In: 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) Leibniz International Proceedings in Informatics, LIPIcs (66) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 16:1-16:14. ISSN 1868-8969
ANNALS OF OPERATIONS RESEARCH, 253 (1)., pp. 707-708. ISSN 0254-5330
Two short proofs regarding the logarithmic least squares optimality in Chen, K., Kou, G., Tarn, J. M., Song, Y. (2015): Bridging the gap between missing and inconsistent values in eliciting preference from pairwise comparison matrices