E. Anshelevich and J. Postl. Randomized social choice functions under metric preferences. Journal of Artificial Intelligence Research, 58:797-827, 2017.
E. Anshelevich, O. Bhardwaj, E. Elkind, J. Postl, and P. Skowron. Approximating optimal social choice under metric preferences. Artificial Intelligence, 264:27-51, 2018.
E. Anshelevich, A. Filos-Ratsikas, N. Shah, and A. A. Voudouris. Distortion in social choice problems: The first 15 years and beyond. arXiv:2103.00911, 2021.
M. Babaioff, Y. Cai, Y. A. Gonczarowski, and M. Zhao. The best of both worlds: Asymptotically efficient mechanisms with a guarantee on the expected gains-from-trade. In Proceedings of the 19th ACM conference on Economics and Computation (EC), page 373, 2018.
C. Boutilier, I. Caragiannis, S. Haber, T. Lu, A. D. Procaccia, and O. Sheffet. Optimal social choice functions: A utilitarian view. Artificial Intelligence, 227:190-213, 2015.
I. Caragiannis, S. Nath, A. D. Procaccia, and N. Shah. Subset selection via implicit utilitarian voting. Journal of Artificial Intelligence Research, 58:123-152, 2017.
Y. Cheng, S. Dughmi, and D. Kempe. Of the people: Voting is more effective with representative candidates. In Proceedings of the 18th ACM Conference on Economics and Computation (EC), pages 305-322, 2017.
Y. Cheng, S. Dughmi, and D. Kempe. On the distortion of voting with multiple representative candidates. In Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI), pages 973-980, 2018.
K. Chung. An estimate concerning the Kolmogoroff limit distribution. Transactions of the American Mathematical Society, 67:36-50, 1949.
N. Devanur, J. Hartline, A. Karlin, and T. Nguyen. Prior-independent multi-parameter mechanism design. In Proceedings of the 7th International Workshop on Internet and Network Economics (WINE), pages 122-133, 2011.
J. P. Dickerson, J. Goldman, J. Karp, A. D. Procaccia, and T. Sandholm. The computational rise and fall of fairness. In Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI), pages 1405-1411, 2014.
S. Ebadian, A. Kahng, D. Peters, and N. Shah. Optimized distortion and proportional fairness in voting. In Proceedings of the 23rd ACM Conference on Economics and Computation (EC), pages 563-600, 2022.
M. Ghodsi, M. Latifian, and M. Seddighin. On the distortion value of the elections with abstention. In Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI), pages 1981-1988, 2019.
V. Gkatzelis, D. Halpern, and N. Shah. Resolving the optimal metric distortion conjecture. In Proceedings of the 61st Symposium on Foundations of Computer Science (FOCS), pages 1427-1438, 2020.
S. Gross, E. Anshelevich, and L. Xia. Vote until two of you agree: Mechanisms with small distortion and sample complexity. In Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI), pages 544-550, 2017.
J. Hartline and T. Roughgarden. Simple versus optimal mechanisms. In Proceedings of the 10th ACM conference on Electronic Commerce (EC), pages 225-234, 2009.
F. E. Kizilkaya and D. Kempe. PluralityVeto: A simple voting rule achieving optimal metric distortion. In Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI), pages 349-355, 2022.
D. Mandal, A. D. Procaccia, N. Shah, and D. P. Woodruff. Efficient and thrifty voting by any means necessary. In Proceedings of the 33rd Annual Conference on Neural Information Processing Systems (NeurIPS), pages 7178-7189, 2019.