Skip to main content

Impartial Selection and the Power of up to Two Choices

  • Conference paper
  • First Online:
Web and Internet Economics (WINE 2015)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9470))

Included in the following conference series:

  • 1092 Accesses

Abstract

We study mechanisms that select members of a set of agents based on nominations by other members and that are impartial in the sense that agents cannot influence their own chance of selection. Prior work has shown that deterministic mechanisms for selecting any fixed number of agents are severely limited, whereas randomization allows for the selection of a single agent that in expectation receives at least 1 / 2 of the maximum number of nominations. The bound of 1 / 2 is in fact best possible subject to impartiality. We prove here that the same bound can also be achieved deterministically by sometimes but not always selecting a second agent. We then show a separation between randomized mechanisms that make exactly two or up to two choices, and give upper and lower bounds on the performance of mechanisms allowed more than two choices.

A. Bjelde and M. Klimm—The research was carried out in the framework of Matheon supported by the Einstein Foundation Berlin.

F. Fischer—Part of the research was carried out while the author was a member of the Statistical Laboratory at the University of Cambridge.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

References

  1. Alon, N., Fischer, F., Procaccia, A.D., 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)

    Google Scholar 

  2. Birkhoff, G.: Tres observaciones sobre el algebra lineal. Revista Facultad de Ciencias Exactas, Puras y Aplicadas Universidad Nacional de Tucumán, Serie A 5, 147–151 (1946)

    Google Scholar 

  3. 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, Heidelberg (2014)

    Chapter  Google Scholar 

  4. de Clippel, G., Moulin, H., Tideman, N.: Impartial division of a dollar. J. Econ. Theor. 139(1), 176–191 (2008)

    Article  MathSciNet  Google Scholar 

  5. Fischer, F., Klimm, M.: Optimal impartial selection. In: Proceedings of the 15th ACM Conference on Economics and Computation, pp. 803–820 (2014)

    Google Scholar 

  6. Holzman, R., Moulin, H.: Impartial nominations for a prize. Econometrica 81(1), 173–196 (2013)

    Article  MathSciNet  Google Scholar 

  7. Mackenzie, A.: Symmetry and impartial lotteries. Games Econ. Behav. 94, 15–28 (2015)

    Article  MathSciNet  Google Scholar 

  8. Mitzenmacher, M., Richa, A.W., Sitaraman, R.: The power of two random choices: a survey of techniques and results. In: Rajasekaran, S., Pardalos, P.M., Reif, J.H., Rolim, J. (eds.) Handbook of Randomized Computing, vol. 1, pp. 255–312. Springer (2001)

    Google Scholar 

  9. Tamura, S., Ohseto, S.: Impartial nomination correspondences. Soc. Choice Welfare 43(1), 47–54 (2014)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

We thank the anonymous referees for their suggestions to improve the presentation of the results.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Max Klimm .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bjelde, A., Fischer, F., Klimm, M. (2015). Impartial Selection and the Power of up to Two Choices. In: Markakis, E., Schäfer, G. (eds) Web and Internet Economics. WINE 2015. Lecture Notes in Computer Science(), vol 9470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48995-6_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-48995-6_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-48994-9

  • Online ISBN: 978-3-662-48995-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics