{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:43:11Z","timestamp":1742913791699,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030859466"},{"type":"electronic","value":"9783030859473"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85947-3_20","type":"book-chapter","created":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T00:45:22Z","timestamp":1631580322000},"page":"299-313","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Metric-Distortion Bounds Under Limited Information"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Anagnostides","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitris","family":"Fotakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiotis","family":"Patsilinakos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,14]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., Voudouris, A.A.: Peeking behind the ordinal curtain: improving distortion via cardinal queries. In: The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, pp. 1782\u20131789. AAAI Press (2020)","DOI":"10.1609\/aaai.v34i02.5544"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Anagnostides, I., Fotakis, D., Patsilinakos, P.: Metric-distortion bounds under limited information. CoRR abs\/2107.02489 (2021)","DOI":"10.1007\/978-3-030-85947-3_20"},{"key":"20_CR3","unstructured":"Anshelevich, E., Bhardwaj, O., Postl, J.: Approximating optimal social choice under metric preferences. In: Bonet, B., Koenig, S. (eds.) Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015, pp. 777\u2013783. AAAI Press (2015)"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Filos-Ratsikas, A., Shah, N., Voudouris, A.A.: Distortion in social choice problems: the first 15 years and beyond (2021)","DOI":"10.24963\/ijcai.2021\/589"},{"key":"20_CR5","unstructured":"Anshelevich, E., Postl, J.: Randomized social choice functions under metric preferences. In: Kambhampati, S. (ed.) Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, pp. 46\u201359. IJCAI\/AAAI Press (2016)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Sekar, S.: Blind, greedy, and random: algorithms for matching and clustering using only ordinal information. In: Schuurmans, D., Wellman, M.P. (eds.) Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, pp. 390\u2013396. AAAI Press (2016)","DOI":"10.1609\/aaai.v30i1.10032"},{"key":"20_CR7","doi-asserted-by":"publisher","unstructured":"Anshelevich, E., Zhu, W.: Ordinal approximation for social choice, matching, and facility location problems given candidate positions. In: Christodoulou, G., Harks, T. (eds.) WINE 2018. LNCS, vol. 11316, pp. 3\u201320. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04612-5_1","DOI":"10.1007\/978-3-030-04612-5_1"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Benade, G., Nath, S., Procaccia, A.D., Shah, N.: Preference elicitation for participatory budgeting. In: Singh, S.P., Markovitch, S. (eds.) Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, pp. 376\u2013382. AAAI Press (2017)","DOI":"10.1609\/aaai.v31i1.10563"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Benad\u00e8, G., Procaccia, A.D., Qiao, M.: Low-distortion social welfare functions. In: The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, pp. 1788\u20131795. AAAI Press (2019)","DOI":"10.1609\/aaai.v33i01.33011788"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Bhaskar, U., Dani, V., Ghosh, A.: Truthful and near-optimal mechanisms for welfare maximization in multi-winner elections. In: McIlraith, S.A., Weinberger, K.Q. (eds.) Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, (AAAI-18), pp. 925\u2013932. AAAI Press (2018)","DOI":"10.1609\/aaai.v32i1.11480"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.artint.2015.06.003","volume":"227","author":"C Boutilier","year":"2015","unstructured":"Boutilier, C., Caragiannis, I., Haber, S., Lu, T., Procaccia, A.D., Sheffet, O.: Optimal social choice functions: a utilitarian view. Artif. Intell. 227, 190\u2013213 (2015)","journal-title":"Artif. Intell."},{"issue":"1","key":"20_CR12","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0020-0190(94)00171-T","volume":"53","author":"R Canetti","year":"1995","unstructured":"Canetti, R., Even, G., Goldreich, O.: Lower bounds for sampling algorithms for estimating the average. Inf. Process. Lett. 53(1), 17\u201325 (1995)","journal-title":"Inf. Process. Lett."},{"key":"20_CR13","unstructured":"Canonne, C.L.: A short note on learning discrete distributions (2020)"},{"key":"20_CR14","doi-asserted-by":"publisher","unstructured":"Caragiannis, I., Filos-Ratsikas, A., Frederiksen, S.K.S., Hansen, K.A., Tan, Z.: Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship. In: Cai, Y., Vetta, A. (eds.) WINE 2016. LNCS, vol. 10123, pp. 236\u2013250. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-54110-4_17","DOI":"10.1007\/978-3-662-54110-4_17"},{"key":"20_CR15","unstructured":"Caragiannis, I., Nath, S., Procaccia, A.D., Shah, N.: Subset selection via implicit utilitarian voting. In: Kambhampati, S. (ed.) Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, pp. 151\u2013157. IJCAI\/AAAI Press (2016)"},{"issue":"4","key":"20_CR16","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/j.inffus.2012.10.005","volume":"14","author":"S Chen","year":"2013","unstructured":"Chen, S., Liu, J., Wang, H., Augusto, J.C.: Ordering based decision making - a survey. Inf. Fusion 14(4), 521\u2013531 (2013)","journal-title":"Inf. Fusion"},{"issue":"3\/4","key":"20_CR17","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1023\/A:1022616323373","volume":"114","author":"S Cho","year":"2003","unstructured":"Cho, S., Endersby, J.W.: Issues, the spatial theory of voting, and British general elections: a comparison of proximity and directional models. Public Choice 114(3\/4), 275\u2013293 (2003)","journal-title":"Public Choice"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Fain, B., Goel, A., Munagala, K., Prabhu, N.: Random dictators with a random referee: constant sample complexity mechanisms for social choice. In: The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, pp. 1893\u20131900. AAAI Press (2019)","DOI":"10.1609\/aaai.v33i01.33011893"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-44803-8_1","volume-title":"Algorithmic Game Theory","author":"A Filos-Ratsikas","year":"2014","unstructured":"Filos-Ratsikas, A., Frederiksen, S.K.S., Zhang, J.: Social welfare in one-sided matchings: random priority and beyond. In: Lavi, R. (ed.) SAGT 2014. LNCS, vol. 8768, pp. 1\u201312. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44803-8_1"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Filos-Ratsikas, A., Voudouris, A.A.: Approximate mechanism design for distributed facility location. CoRR abs\/2007.06304 (2020)","DOI":"10.1007\/978-3-030-85947-3_4"},{"key":"20_CR21","unstructured":"Fotakis, D., Kalavasis, A., Stavropoulos, K.: Aggregating incomplete and noisy rankings. In: Banerjee, A., Fukumizu, K. (eds.) The 24th International Conference on Artificial Intelligence and Statistics, AISTATS 2021. Proceedings of Machine Learning Research, vol. 130, pp. 2278\u20132286. PMLR (2021)"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"Gkatzelis, V., Halpern, D., Shah, N.: Resolving the optimal metric distortion conjecture. In: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, pp. 1427\u20131438. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00134"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Goel, A., Krishnaswamy, A.K., Munagala, K.: Metric distortion of social choice rules: lower bounds and fairness properties. In: Proceedings of the 2017 ACM Conference on Economics and Computation, p. 287\u2013304. EC 2017, Association for Computing Machinery (2017)","DOI":"10.1145\/3033274.3085138"},{"key":"20_CR24","unstructured":"Gross, S., Anshelevich, E., Xia, L.: Vote until two of you agree: mechanisms with small distortion and sample complexity. In: Singh, S.P., Markovitch, S. (eds.) Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017, pp. 544\u2013550. AAAI Press (2017)"},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"Kempe, D.: An analysis framework for metric voting based on LP duality. In: The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, pp. 2079\u20132086. AAAI Press (2020)","DOI":"10.1609\/aaai.v34i02.5581"},{"key":"20_CR26","doi-asserted-by":"crossref","unstructured":"Kempe, D.: Communication, distortion, and randomness in metric voting. In: The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, pp. 2087\u20132094. AAAI Press (2020)","DOI":"10.1609\/aaai.v34i02.5582"},{"key":"20_CR27","unstructured":"Lang, J., Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Winner determination in sequential majority voting. In: Veloso, M.M. (ed.) IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence, pp. 1372\u20131377 (2007)"},{"key":"20_CR28","unstructured":"Mandal, D., Procaccia, A.D., Shah, N., Woodruff, D.P.: Efficient and thrifty voting by any means necessary. In: Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, pp. 7178\u20137189 (2019)"},{"key":"20_CR29","doi-asserted-by":"crossref","unstructured":"Mandal, D., Shah, N., Woodruff, D.P.: Optimal communication-distortion tradeoff in voting. In: Proceedings of the 21st ACM Conference on Economics and Computation, p. 795\u2013813. EC 2020, Association for Computing Machinery (2020)","DOI":"10.1145\/3391403.3399510"},{"key":"20_CR30","doi-asserted-by":"crossref","unstructured":"Munagala, K., Wang, K.: Improved metric distortion for deterministic social choice rules. In: Karlin, A., Immorlica, N., Johari, R. (eds.) Proceedings of the 2019 ACM Conference on Economics and Computation, EC 2019, pp. 245\u2013262. ACM (2019)","DOI":"10.1145\/3328526.3329550"},{"key":"20_CR31","volume-title":"Theory of Games and Economic Behavior","author":"J von Neumann","year":"1944","unstructured":"von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behavior. Princeton University Press, Princeton (1944)"},{"key":"20_CR32","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/11839354_23","volume-title":"Cooperative Information Agents X","author":"AD Procaccia","year":"2006","unstructured":"Procaccia, A.D., Rosenschein, J.S.: The distortion of cardinal preferences in voting. In: Klusch, M., Rovatsos, M., Payne, T.R. (eds.) CIA 2006. LNCS (LNAI), vol. 4149, pp. 317\u2013331. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11839354_23"},{"issue":"1","key":"20_CR33","first-page":"51","volume":"8","author":"DG Saari","year":"1996","unstructured":"Saari, D.G., Merlin, V.R.: The Copeland method: I.: relationships and the dictionary. Econ. Theor. 8(1), 51\u201376 (1996)","journal-title":"Econ. Theor."},{"key":"20_CR34","unstructured":"Skowron, P.K., Elkind, E.: Social choice under metric preferences: Scoring rules and STV. In: Singh, S.P., Markovitch, S. (eds.) Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4\u20139, 2017, San Francisco, California, USA, pp. 706\u2013712. AAAI Press (2017)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85947-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T03:38:28Z","timestamp":1673235508000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85947-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030859466","9783030859473"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85947-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"14 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2021","order":10,"name":"conference_id","label":"Conference ID","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":"73","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":"26","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":"36% - 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":"7.5","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":"4 abstracts of presented papers are also included.","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)"}}]}}