{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T04:07:05Z","timestamp":1751861225671,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030877552"},{"type":"electronic","value":"9783030877569"}],"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-87756-9_3","type":"book-chapter","created":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T23:05:40Z","timestamp":1635289540000},"page":"35-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Preference Aggregation in the Generalised Unavailable Candidate Model"],"prefix":"10.1007","author":[{"given":"Arnaud","family":"Grivet S\u00e9bert","sequence":"first","affiliation":[]},{"given":"Nicolas","family":"Maudet","sequence":"additional","affiliation":[]},{"given":"Patrice","family":"Perny","sequence":"additional","affiliation":[]},{"given":"Paolo","family":"Viappiani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,27]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Apesteguia, J., Ballester, M.A.: A measure of rationality and welfare. J. Polit. Econ. 123(6), 1278\u20131310 (2015)","DOI":"10.1086\/683838"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Baldiga, K.A., Green, J.R.: Assent-maximizing social choice. Soc. Choice Welfare 40(2), 439\u2013460 (2013)","DOI":"10.1007\/s00355-011-0614-6"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Bartholdi, J., Tovey, C.A., Trick, M.A.: Voting schemes for which it can be difficult to tell who won the election. Soc. Choice welfare 6(2), 157\u2013165 (1989)","DOI":"10.1007\/BF00303169"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Berg, S., Lepelley, D.: On probability models in voting theory. Statistica Neerlandica 48(2), 133\u2013146 (1994)","DOI":"10.1111\/j.1467-9574.1994.tb01438.x"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Boutilier, C., Lang, J., Oren, J., Palacios, H.: Robust winners and winner determination policies under candidate uncertainty. In: Twenty-Eighth AAAI Conference on Artificial Intelligence. AAAI, Qu\u00e9bec (2014)","DOI":"10.1609\/aaai.v28i1.8893"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D.: Handbook of Computational Social Choice. Cambridge University Press, Cambridge (2016)","DOI":"10.1017\/CBO9781107446984.002"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Chevaleyre, Y., Lang, J., Maudet, N., Monnot, J., Xia, L.: New candidates welcome! possible winners with respect to the addition of new candidates. Math. Soc. Sci. 64(1), 74\u201388 (2012)","DOI":"10.1016\/j.mathsocsci.2011.12.003"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Dutta, B., Jackson, M.O., Le Breton, M.: Strategic candidacy and voting procedures. Econometrica 69(4), 1013\u20131037 (2001)","DOI":"10.1111\/1468-0262.00228"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Dutta, B., Jackson, M.O., Le Breton, M.: Voting by successive elimination and strategic candidacy. J. Econ. Theory 103(1), 190\u2013218 (2002)","DOI":"10.1006\/jeth.2001.2862"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-Lapresta, J.L., P\u00e9rez-Rom\u00e1n, D.: Consensus measures generated by weighted kemeny distances on weak orders. In: 2010 10th International Conference on Intelligent Systems Design and Applications, pp. 463\u2013468. IEEE Computer Society, Cairo (2010)","DOI":"10.1109\/ISDA.2010.5687220"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Gilbert, H., Portoleau, T., Spanjaard, O.: Beyond pairwise comparisons in social choice: a setwise kemeny aggregation problem. In: Thirty-Fourth AAAI Conference on Artificial Intelligence, pp. 1982\u20131989 (2020)","DOI":"10.1609\/aaai.v34i02.5569"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Klamler, C.: A distance measure for choice functions. Soc. Choice Welfare 30(3), 419\u2013425 (2008)","DOI":"10.1007\/s00355-007-0239-y"},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Lang, J., Maudet, N., Polukarov, M.: New results on equilibria in strategic candidacy. In: V\u00f6, B. (ed.) SAGT 2013. LNCS, vol. 8146cience. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41392-6_2","DOI":"10.1007\/978-3-642-41392-6_2"},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"Laslier, J.F.: And the loser is$$\\ldots $$ plurality voting. In: Felsenthal, D., Machover, M. (eds.) Electoral Systems. SCW, pp. 327\u2013351. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-20441-8_13","DOI":"10.1007\/978-3-642-20441-8_13"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Lu, T., Boutilier, C.E.: The unavailable candidate model: a decision-theoretic view of social choice. In: Proceedings of the 11th ACM Conference on Electronic Commerce, pp. 263\u2013274 (2010)","DOI":"10.1145\/1807342.1807385"},{"key":"3_CR16","unstructured":"Lumet, C., Bouveret, S., Lema\u00eetre, M.: Fair division of indivisible goods under risk (2012)"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Naamani-Dery, L., Kalech, M., Rokach, L., Shapira, B.: Reducing preference elicitation in group decision making. Expert Syst. Appl. 61, 246\u2013261 (2016)","DOI":"10.1016\/j.eswa.2016.05.041"},{"key":"3_CR18","unstructured":"Oren, J., Filmus, Y., Boutilier, C.: Efficient vote elicitation under candidate uncertainty. In: IJCAI, pp. 309\u2013316 (2013)"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Shieh, G.S.: A weighted kendall\u2019s tau statistic. Stat. Prob. Lett. 39(1), 17\u201324 (1998)","DOI":"10.1016\/S0167-7152(98)00006-6"},{"key":"3_CR20","unstructured":"Viappiani, P.: Characterization of scoring rules with distances: application to the clustering of rankings. In: Twenty-Fourth International Joint Conference on Artificial Intelligence (2015)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87756-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T22:01:25Z","timestamp":1673647285000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87756-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030877552","9783030877569"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87756-9_3","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":"27 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Decision Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"3 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aldt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.irit.fr\/ADT2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"58","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":"27","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":"47% - 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","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)"}}]}}