{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:31:00Z","timestamp":1742999460235,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030664114"},{"type":"electronic","value":"9783030664121"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-66412-1_18","type":"book-chapter","created":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T09:04:55Z","timestamp":1609751095000},"page":"279-298","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximating Voting Rules from\u00a0Truncated Ballots"],"prefix":"10.1007","author":[{"given":"Manel","family":"Ayadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nahla Ben","family":"Amor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00f4me","family":"Lang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,5]]},"reference":[{"key":"18_CR1","unstructured":"Ayadi, M., Ben Amor, N., Lang, J., Peters, D.: Single transferable vote: incomplete knowledge and communication issues. In: Proceedings of the 18th International Conference on Autonomous Agents and Multi-Agent Systems, pp. 1288\u20131296. International Foundation for Autonomous Agents and Multi-agent Systems (2019)"},{"key":"18_CR2","unstructured":"Baumeister, D., Faliszewski, P., Lang, J., Rothe, J.: Campaigns for lazy voters: truncated ballots. In: Proceedings of the 11th International Conference on Autonomous Agents and Multi-agent Systems-Vol. 2, pp. 577\u2013584. International Foundation for Autonomous Agents and Multi-agent Systems (2012)"},{"key":"18_CR3","doi-asserted-by":"publisher","unstructured":"Bentert, M., Skowron, P.: Comparing election methods where each voter ranks only few candidates. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02, pp. 2218\u20132225 (2020). https:\/\/doi.org\/10.1609\/aaai.v34i02.5598","DOI":"10.1609\/aaai.v34i02.5598"},{"key":"18_CR4","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."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Boutilier, C., Rosenschein, J.S.: Incomplete information and communication in voting. In: Handbook of Computational Social Choice, pp. 223\u2013258 (2016)","DOI":"10.1017\/CBO9781107446984.011"},{"key":"18_CR6","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1609\/aaai.v27i1.8667","volume":"13","author":"S Br\u00e2nzei","year":"2013","unstructured":"Br\u00e2nzei, S., Caragiannis, I., Morgenstern, J., Procaccia, A.D.: How bad is selfish voting? AAAI. 13, 138\u2013144 (2013)","journal-title":"AAAI."},{"issue":"2","key":"18_CR7","first-page":"6","volume":"10","author":"I Caragiannis","year":"2014","unstructured":"Caragiannis, I., Kaklamanis, C., Karanikolas, N., Procaccia, A.D.: Socially desirable approximations for Dodgson\u2019s voting rule. ACM Trans. Algorithms (TALG) 10(2), 6 (2014)","journal-title":"ACM Trans. Algorithms (TALG)"},{"issue":"4","key":"18_CR8","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1007\/s00355-013-0751-1","volume":"42","author":"J Cullinan","year":"2014","unstructured":"Cullinan, J., Hsiao, S.K., Polett, D.: A borda count for partially ordered ballots. Soc. Choice Welf. 42(4), 913\u2013926 (2014)","journal-title":"Soc. Choice Welf."},{"key":"18_CR9","doi-asserted-by":"publisher","unstructured":"d\u2019Aspremont, C., Gevers, L.: Chapter 10 social welfare functional and interpersonal comparability. In: Handbook of Social Choice and Welfare, vol. 1, pp. 459\u2013541. Elsevier (2002). https:\/\/doi.org\/10.1016\/S1574-0110(02)80014-5","DOI":"10.1016\/S1574-0110(02)80014-5"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/j.ins.2014.03.065","volume":"278","author":"LN Dery","year":"2014","unstructured":"Dery, L.N., Kalech, M., Rokach, L., Shapira, B.: Reaching a joint decision with minimal elicitation of voter preferences. Inform. Sci. 278, 466\u2013487 (2014). Elsevier","journal-title":"Inform. Sci."},{"key":"18_CR11","volume-title":"The Politics of Consensus: For The Resolution of Conflict and Reform of Majority Rule","author":"PJ Emerson","year":"1994","unstructured":"Emerson, P.J.: The Politics of Consensus: For The Resolution of Conflict and Reform of Majority Rule. De Borda Institute, Belfast (1994)"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Filmus, Y., Oren, J.: Efficient voting via the top-k elicitation scheme: a probabilistic approach. In: Proceedings of the Fifteenth ACM Conference on Economics and Computation, pp. 295\u2013312. ACM (2014)","DOI":"10.1145\/2600057.2602829"},{"issue":"3\u20134","key":"18_CR13","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s10472-015-9488-0","volume":"77","author":"U Grandi","year":"2016","unstructured":"Grandi, U., Loreggia, A., Rossi, F., Saraswat, V.: A Borda count for collective sentiment analysis. Ann. Math. Artif. Intell. 77(3\u20134), 281\u2013302 (2016). https:\/\/doi.org\/10.1007\/s10472-015-9488-0","journal-title":"Ann. Math. Artif. Intell."},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10458-010-9133-6","volume":"22","author":"M Kalech","year":"2011","unstructured":"Kalech, M., Kraus, S., Kaminka, G.A., Goldman, C.V.: Practical voting rules with partial information. Autonom. Agents Multi-Agent Syst. 22, 151\u2013182 (2011). Springer","journal-title":"Autonom. Agents Multi-Agent Syst."},{"key":"18_CR15","unstructured":"Lackner, M.: Incomplete preferences in single-peaked electorates. In: Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27\u201331, 2014, Qu\u00e9bec City, Qu\u00e9bec, Canada, pp. 742\u2013748 (2014)"},{"key":"18_CR16","first-page":"287","volume":"22","author":"T Lu","year":"2011","unstructured":"Lu, T., Boutilier, C.: Robust approximation and incremental elicitation in voting protocols. Proceedings of IJCAI International Joint Conference on Artificial Intelligence. 22, 287\u2013293 (2011)","journal-title":"Proceedings of IJCAI International Joint Conference on Artificial Intelligence."},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-24873-3_11","volume-title":"Algorithmic Decision Theory","author":"T Lu","year":"2011","unstructured":"Lu, T., Boutilier, C.: Vote elicitation with probabilistic preference models: empirical estimation and cost tradeoffs. In: Brafman, R.I., Roberts, F.S., Tsouki\u00e0s, A. (eds.) ADT 2011. LNCS (LNAI), vol. 6992, pp. 135\u2013149. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24873-3_11"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Mallows, C.L.: Non-null ranking models. I. Biometrika, pp. 114\u2013130 (1957)","DOI":"10.1093\/biomet\/44.1-2.114"},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-41575-3_20","volume-title":"Algorithmic Decision Theory","author":"N Mattei","year":"2013","unstructured":"Mattei, N., Walsh, T.: PrefLib: a library for preferences http:\/\/www.preflib.org. In: Perny, P., Pirlot, M., Tsouki\u00e0s, A. (eds.) ADT 2013. LNCS (LNAI), vol. 8176, pp. 259\u2013270. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41575-3_20"},{"key":"18_CR20","unstructured":"Narodytska, N., Walsh, T.: The computational impact of partial votes on strategic voting. In: ECAI 2014\u201321st European Conference on Artificial Intelligence, 18\u201322 August 2014, Prague, Czech Republic - Including Prestigious Applications of Intelligent Systems (PAIS 2014), pp. 657\u2013662 (2014)"},{"key":"18_CR21","unstructured":"Oren, J., Filmus, Y., Boutilier, C.: Efficient vote elicitation under candidate uncertainty. In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, pp. 309\u2013316. AAAI Press (2013)"},{"key":"18_CR22","first-page":"593","volume":"2012","author":"Service, T.C., Adams, J.A.","year":"2012","unstructured":"Service, T.C., Adams, J.A.: Communication complexity of approximating voting rules. Int. Conf. Autonom. Agents Multi-agent Syst. AAMAS 2012, 593\u2013602 (2012)","journal-title":"Int. Conf. Autonom. Agents Multi-agent Syst. AAMAS"},{"key":"18_CR23","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.artint.2015.01.003","volume":"222","author":"P Skowron","year":"2015","unstructured":"Skowron, P., Faliszewski, P., Slinko, A.: Achieving fully proportional representation: approximability results. Artif. Intell. 222, 67\u2013103 (2015)","journal-title":"Artif. Intell."},{"issue":"4","key":"18_CR24","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1137\/0128067","volume":"28","author":"HP Young","year":"1975","unstructured":"Young, H.P.: Social choice scoring functions. SIAM J. Appl. Math. 28(4), 824\u2013838 (1975)","journal-title":"SIAM J. Appl. Math."},{"key":"18_CR25","unstructured":"Zhao, Z., et al.: A cost-effective framework for preference elicitation and aggregation. In: Proceedings of the Thirty-Fourth Conference on Uncertainty in Artificial Intelligence, UAI 2018, Monterey, California, USA, August 6\u201310, 2018, pp. 446\u2013456 (2018)"}],"container-title":["Lecture Notes in Computer Science","Multi-Agent Systems and Agreement Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-66412-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T10:05:37Z","timestamp":1670666737000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-66412-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030664114","9783030664121"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-66412-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"5 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUMAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Multi-Agent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eumas2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eumas2020.csd.auth.gr\/eumas2020\/","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":"49","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":"35","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":"71% - 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.2","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":"1.8","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":"Due to COVID-19 pandemic the conference was held virtually","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)"}}]}}