{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T20:09:17Z","timestamp":1760299757833,"version":"3.41.0"},"reference-count":18,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2017,11,30]],"date-time":"2017-11-30T00:00:00Z","timestamp":1512000000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ECMath","award":["MI5"],"award-info":[{"award-number":["MI5"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Econ. Comput."],"published-print":{"date-parts":[[2017,11,30]]},"abstract":"<jats:p>\n            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\n            <jats:italic>k<\/jats:italic>\n            of agents are severely limited and cannot extract a constant fraction of the nominations of the\n            <jats:italic>k<\/jats:italic>\n            most highly nominated agents. We prove here that this impossibility result can be circumvented by allowing the mechanism to sometimes but not always select fewer than\n            <jats:italic>k<\/jats:italic>\n            agents. This added flexibility also improves the performance of randomized mechanisms, for which we show a separation between mechanisms that make exactly two or up to two choices and give upper and lower bounds for mechanisms allowed more than two choices.\n          <\/jats:p>","DOI":"10.1145\/3107922","type":"journal-article","created":{"date-parts":[[2017,12,22]],"date-time":"2017-12-22T17:17:37Z","timestamp":1513963057000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Impartial Selection and the Power of Up to Two Choices"],"prefix":"10.1145","volume":"5","author":[{"given":"Antje","family":"Bjelde","sequence":"first","affiliation":[{"name":"Humboldt-Universit\u00e4t zu Berlin, Germany"}]},{"given":"Felix","family":"Fischer","sequence":"additional","affiliation":[{"name":"University of Glasgow, UK"}]},{"given":"Max","family":"Klimm","sequence":"additional","affiliation":[{"name":"Humboldt-Universit\u00e4t zu Berlin, Germany"}]}],"member":"320","published-online":{"date-parts":[[2017,12,22]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2000378.2000390"},{"volume-title":"Proceedings of the 30th AAAI Conference on Artificial Intelligence. 390--396","author":"Aziz H.","key":"e_1_2_1_2_1","unstructured":"H. Aziz , O. Lev , N. Mattei , J. S. Rosenschein , and T. Walsh . 2016. Strategyproof peer selection: Mechanisms, analyses, and experiments . In Proceedings of the 30th AAAI Conference on Artificial Intelligence. 390--396 . H. Aziz, O. Lev, N. Mattei, J. S. Rosenschein, and T. Walsh. 2016. Strategyproof peer selection: Mechanisms, analyses, and experiments. In Proceedings of the 30th AAAI Conference on Artificial Intelligence. 390--396."},{"key":"e_1_2_1_3_1","first-page":"147","article-title":"Tres observaciones sobre el algebra lineal. Revista Facultad de Ciencias Exactas, Puras y Aplicadas Universidad Nacional de Tucum\u00e1n","volume":"5","author":"Birkhoff G.","year":"1946","unstructured":"G. Birkhoff . 1946 . Tres observaciones sobre el algebra lineal. Revista Facultad de Ciencias Exactas, Puras y Aplicadas Universidad Nacional de Tucum\u00e1n , Serie A 5 (1946), 147 -- 151 . G. Birkhoff. 1946. Tres observaciones sobre el algebra lineal. Revista Facultad de Ciencias Exactas, Puras y Aplicadas Universidad Nacional de Tucum\u00e1n, Serie A 5 (1946), 147--151.","journal-title":"Serie A"},{"volume-title":"Proceedings of the 10th International Conference on Web and Internet Economics. 133--146","author":"Bousquet N.","key":"e_1_2_1_4_1","unstructured":"N. Bousquet , S. Norin , and A. Vetta . 2014. A near-optimal mechanism for impartial selection . In Proceedings of the 10th International Conference on Web and Internet Economics. 133--146 . N. Bousquet, S. Norin, and A. Vetta. 2014. A near-optimal mechanism for impartial selection. In Proceedings of the 10th International Conference on Web and Internet Economics. 133--146."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54110-4_17"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2007.06.005"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/140995775"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.3982\/ECTA10523"},{"volume-title":"Proceedings of the 24th International Joint Conference on Artificial Intelligence. 582--588","author":"Kurokawa D.","key":"e_1_2_1_9_1","unstructured":"D. Kurokawa , O. Lev , J. Morgenstern , and A. D. Procaccia . 2015. Impartial peer review . In Proceedings of the 24th International Joint Conference on Artificial Intelligence. 582--588 . D. Kurokawa, O. Lev, J. Morgenstern, and A. D. Procaccia. 2015. Impartial peer review. In Proceedings of the 24th International Joint Conference on Artificial Intelligence. 582--588."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2015.08.007"},{"key":"e_1_2_1_11_1","unstructured":"A. Mackenzie. 2017. A game of the throne of Saint Peter. (2017). Working paper.  A. Mackenzie. 2017. A game of the throne of Saint Peter. (2017). Working paper."},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","unstructured":"M. Mitzenmacher A.W. Richa and R. Sitaraman. 2001. The power of two random choices: A survey of techniques and results. In Handbook of Randomized Computing S. Rajasekaran P. M. Pardalos J. H. Reif and J. Rolim (Eds.). Vol. 1. Springer 255--312.  M. Mitzenmacher A.W. Richa and R. Sitaraman. 2001. The power of two random choices: A survey of techniques and results. In Handbook of Randomized Computing S. Rajasekaran P. M. Pardalos J. H. Reif and J. Rolim (Eds.). Vol. 1. Springer 255--312.","DOI":"10.1007\/978-1-4615-0013-1_9"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2542174.2542175"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2015.12.005"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00355-013-0772-9"},{"volume-title":"Proceedings of the 1st AAAI Conference on Human Computation and Crowdsourcing. 190--197","author":"Witkowski J.","key":"e_1_2_1_17_1","unstructured":"J. Witkowski , Y. Bachrach , P. Key , and D. C. Parkes . 2013. Dwelling on the negative: Incentivizing effort in peer prediction . In Proceedings of the 1st AAAI Conference on Human Computation and Crowdsourcing. 190--197 . J. Witkowski, Y. Bachrach, P. Key, and D. C. Parkes. 2013. Dwelling on the negative: Incentivizing effort in peer prediction. In Proceedings of the 1st AAAI Conference on Human Computation and Crowdsourcing. 190--197."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229085"}],"container-title":["ACM Transactions on Economics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3107922","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3107922","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:25Z","timestamp":1750217425000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3107922"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,30]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,11,30]]}},"alternative-id":["10.1145\/3107922"],"URL":"https:\/\/doi.org\/10.1145\/3107922","relation":{},"ISSN":["2167-8375","2167-8383"],"issn-type":[{"type":"print","value":"2167-8375"},{"type":"electronic","value":"2167-8383"}],"subject":[],"published":{"date-parts":[[2017,11,30]]},"assertion":[{"value":"2016-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-12-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}