5 papers
Evaluating approval-based multiwinner voting in terms of robustness to noise
Ioannis Caragiannis, Christos Kaklamanis, Nikos Karanikolas +1
Approval-based multiwinner voting rules have recently received much attention in the Computational Social Choice literature. Such rules aggregate approval ballots and determine a w…
Optimizing positional scoring rules for rank aggregation
Ioannis Caragiannis, Xenophon Chatzigeorgiou, George A. Krimpas +1
Nowadays, several crowdsourcing projects exploit social choice methods for computing an aggregate ranking of alternatives given individual rankings provided by workers. Motivated b…
How effective can simple ordinal peer grading be?
Ioannis Caragiannis, George A. Krimpas, Alexandros A. Voudouris
Ordinal peer grading has been proposed as a simple and scalable solution for computing reliable information about student performance in massive open online courses. The idea is to…
Efficiency and complexity of price competition among single-product vendors
Ioannis Caragiannis, Xenophon Chatzigeorgiou, Panagiotis Kanellopoulos +3
Motivated by recent progress on pricing in the AI literature, we study marketplaces that contain multiple vendors offering identical or similar products and unit-demand buyers with…
Aggregating partial rankings with applications to peer grading in massive online open courses
Ioannis Caragiannis, George A. Krimpas, Alexandros A. Voudouris
We investigate the potential of using ordinal peer grading for the evaluation of students in massive online open courses (MOOCs). According to such grading schemes, each student re…