Abstract
Impartial selection has recently received much attention within the multi-agent systems community. The task is, given a directed graph representing nominations to the members of a community by other members, to select the member with the highest number of nominations. This seemingly trivial goal becomes challenging when there is an additional impartiality constraint, requiring that no single member can influence her chance of being selected. Recent progress has identified impartial selection rules with optimal approximation ratios. Moreover, it was noted that worst-case instances are graphs with few vertices. Motivated by this fact, we propose the study of additive approximation, the difference between the highest number of nominations and the number of nominations of the selected member, as an alternative measure of the quality of impartial selection.
Our positive results include two randomized impartial selection mechanisms which have additive approximation guarantees of \(\varTheta (\sqrt{n})\) and \(\varTheta (n^{2/3}\ln ^{1/3}n)\) for the two most studied models in the literature, where n denotes the community size. We complement our positive results by providing negative results for various cases. First, we provide a characterization for the interesting class of strong sample mechanisms, which allows us to obtain lower bounds of \(n-2\), and of \(\varOmega (\sqrt{n})\) for their deterministic and randomized variants respectively. Finally, we present a general lower bound of 2 for all deterministic impartial mechanisms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
- 2.
The authors in [6] do not provide additive guarantees, hence we based our calculations on their provided bounds on the multiplicative guarantee \(1-\epsilon \). It is important to note however that they claim that they have not optimized their parameters, so it is possible that this guarantee can be further reduced by a tighter analysis.
- 3.
For simplicity we use the notation (g, f) rather the more precise (g, f(g)).
References
Alon, N., Fischer, F., Procaccia, A., Tennenholtz, M.: Sum of us: strategyproof selection from the selectors. In: Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge, pp. 101–110 (2011)
Attiya, H., Welch, J.: Distributed Computing: Fundamental, Simulations, and Advanced Topics, 2nd edn. Wiley, Hoboken (2004)
Aziz, H., Lev, O., Mattei, N., Rosenschein, J.S., Walsh, T.: Strategyproof peer selection: mechanisms, analyses, and experiments. In: Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI), pp. 397–403 (2016)
Babichenko, Y., Dean, O., Tennenholtz, M.: Incentive-compatible diffusion. In: Proceedings of the 27th International Conference on World Wide Web (WWW), pp. 1379–1388 (2018)
Bjelde, A., Fischer, F., Klimm, M.: Impartial selection and the power of up to two choices. ACM Trans. Econ. Comput. 5(4), 21 (2017)
Bousquet, N., Norin, S., Vetta, A.: A near-optimal mechanism for impartial selection. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 133–146. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-13129-0_10
Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.): Handbook of Computational Social Choice. Cambridge University Press, New York (2016)
Chen, Y., Podimata, C., Procaccia, A.D., Shah, N.: Strategyproof linear regression in high dimensions. In: Proceedings of the 19th ACM Conference on Economics and Computation (EC), pp. 9–26 (2018)
de Clippel, G., Moulin, H., Tideman, N.: Impartial division of a dollar. J. Econ. Theor. 139(1), 176–191 (2008)
Fischer, F., Klimm, M.: Optimal impartial selection. SIAM J. Comput. 44(5), 1263–1285 (2015)
Holzman, R., Moulin, H.: Impartial nominations for a prize. Econometrica 81(1), 173–196 (2013)
Kahng, A., Kotturi, Y., Kulkarni, C., Kurokawa, D., Procaccia, A.D.: Ranking wily people who rank each other. In: Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI), pp. 1087–1094 (2018)
Kurokawa, D., Lev, O., Morgenstern, J., Procaccia, A.D.: Impartial peer review. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI), pp. 582–588 (2015)
Mackenzie, A.: Symmetry and impartial lotteries. Games Econ. Behav. 94, 15–28 (2015)
Tamura, S.: Characterizing minimal impartial rules for awarding prizes. Games Econ. Behav. 95, 41–46 (2016)
Tamura, S., Ohseto, S.: Impartial nomination correspondences. Soc. Choice Welfare 43(1), 47–54 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Caragiannis, I., Christodoulou, G., Protopapas, N. (2019). Impartial Selection with Additive Approximation Guarantees. In: Fotakis, D., Markakis, E. (eds) Algorithmic Game Theory. SAGT 2019. Lecture Notes in Computer Science(), vol 11801. Springer, Cham. https://doi.org/10.1007/978-3-030-30473-7_18
Download citation
DOI: https://doi.org/10.1007/978-3-030-30473-7_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-30472-0
Online ISBN: 978-3-030-30473-7
eBook Packages: Computer ScienceComputer Science (R0)