{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T20:03:39Z","timestamp":1778270619830,"version":"3.51.4"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031228315","type":"print"},{"value":"9783031228322","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22832-2_11","type":"book-chapter","created":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T09:05:33Z","timestamp":1670490333000},"page":"187-203","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimal Impartial Correspondences"],"prefix":"10.1007","author":[{"given":"Javier","family":"Cembrano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felix","family":"Fischer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Max","family":"Klimm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,9]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"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\u2013110 (2011)","DOI":"10.1145\/2000378.2000390"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.artint.2019.06.004","volume":"275","author":"H Aziz","year":"2019","unstructured":"Aziz, H., Lev, O., Mattei, N., Rosenschein, J.S., Walsh, T.: Strategyproof peer selection using randomization, partitioning, and apportionment. Artif. Intell. 275, 295\u2013309 (2019)","journal-title":"Artif. Intell."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Babichenko, Y., Dean, O., Tennenholtz, M.: Incentive-compatible selection mechanisms for forests. In: Proceedings of the 21st ACM Conference on Economics and Computation, pp. 111\u2013131 (2020)","DOI":"10.1145\/3391403.3399456"},{"issue":"4","key":"11_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3107922","volume":"5","author":"A Bjelde","year":"2017","unstructured":"Bjelde, A., Fischer, F., Klimm, M.: Impartial selection and the power of up to two choices. ACM Trans. Econ. Comput. 5(4), 1\u201320 (2017)","journal-title":"ACM Trans. Econ. Comput."},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-319-13129-0_10","volume-title":"Web and Internet Economics","author":"N Bousquet","year":"2014","unstructured":"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\u2013146. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13129-0_10"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-030-30473-7_18","volume-title":"Algorithmic Game Theory","author":"I Caragiannis","year":"2019","unstructured":"Caragiannis, I., Christodoulou, G., Protopapas, N.: Impartial selection with additive approximation guarantees. In: Fotakis, D., Markakis, E. (eds.) SAGT 2019. LNCS, vol. 11801, pp. 269\u2013283. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30473-7_18"},{"key":"11_CR7","unstructured":"Caragiannis, I., Christodoulou, G., Protopapas, N.: Impartial selection with prior information. arXiv preprint arXiv:2102.09002 (2021)"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Cembrano, J., Fischer, F., Hannon, D., Klimm, M.: Impartial selection with additive guarantees via iterated deletion. arXiv preprint arXiv:2205.08979 (2022)","DOI":"10.1145\/3490486.3538294"},{"issue":"1","key":"11_CR9","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.jet.2007.06.005","volume":"139","author":"G De Clippel","year":"2008","unstructured":"De Clippel, G., Moulin, H., Tideman, N.: Impartial division of a dollar. J. Econ. Theory 139(1), 176\u2013191 (2008)","journal-title":"J. Econ. Theory"},{"issue":"5","key":"11_CR10","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1137\/140995775","volume":"44","author":"F Fischer","year":"2015","unstructured":"Fischer, F., Klimm, M.: Optimal impartial selection. SIAM J. Comput. 44(5), 1263\u20131285 (2015)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"173","DOI":"10.3982\/ECTA10523","volume":"81","author":"R Holzman","year":"2013","unstructured":"Holzman, R., Moulin, H.: Impartial nominations for a prize. Econometrica 81(1), 173\u2013196 (2013)","journal-title":"Econometrica"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"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 (2018)","DOI":"10.1609\/aaai.v32i1.11467"},{"key":"11_CR13","unstructured":"Kurokawa, D., Lev, O., Morgenstern, J., Procaccia, A.D.: Impartial peer review. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence (2015)"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.geb.2015.08.007","volume":"94","author":"A Mackenzie","year":"2015","unstructured":"Mackenzie, A.: Symmetry and impartial lotteries. Games Econom. Behav. 94, 15\u201328 (2015)","journal-title":"Games Econom. Behav."},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/s00199-019-01180-0","volume":"69","author":"A Mackenzie","year":"2020","unstructured":"Mackenzie, A.: An axiomatic analysis of the papal conclave. Econ. Theor. 69, 713\u2013743 (2020)","journal-title":"Econ. Theor."},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Mattei, N., Turrini, P., Zhydkov, S.: PeerNomination: relaxing exactness for increased accuracy in peer selection. arXiv preprint arXiv:2004.14939 (2020)","DOI":"10.24963\/ijcai.2020\/55"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.geb.2015.12.005","volume":"95","author":"S Tamura","year":"2016","unstructured":"Tamura, S.: Characterizing minimal impartial rules for awarding prizes. Games Econom. Behav. 95, 41\u201346 (2016)","journal-title":"Games Econom. Behav."},{"issue":"1","key":"11_CR18","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s00355-013-0772-9","volume":"43","author":"S Tamura","year":"2014","unstructured":"Tamura, S., Ohseto, S.: Impartial nomination correspondences. Soc. Choice Welfare 43(1), 47\u201354 (2014)","journal-title":"Soc. Choice Welfare"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"W\u0105s, T., Rahwan, T., Skibski, O.: Random walk decay centrality. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 2197\u20132204 (2019)","DOI":"10.1609\/aaai.v33i01.33012197"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Xu, Y., Zhao, H., Shi, X., Zhang, J., Shah, N.B.: On strategyproof conference peer review. arXiv preprint arXiv:1806.06266 (2018)","DOI":"10.24963\/ijcai.2019\/87"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-030-85947-3_6","volume-title":"Algorithmic Game Theory","author":"X Zhang","year":"2021","unstructured":"Zhang, X., Zhang, Y., Zhao, D.: Incentive compatible mechanism for influential agent selection. In: Caragiannis, I., Hansen, K.A. (eds.) SAGT 2021. LNCS, vol. 12885, pp. 79\u201393. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85947-3_6"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22832-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:47:37Z","timestamp":1710269257000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22832-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031228315","9783031228322"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22832-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"9 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Troy, NY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.rpi.edu\/wine2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"126","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19 abstracts in the back matter","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}