Preference aggregation in the generalised unavailable candidate model

DOI10.1007/978-3-030-87756-9_3OpenAlexW3210860015MaRDI QIDQ2695424

Nicolas Maudet, Arnaud Grivet Sébert, Paolo Viappiani, Patrice Perny

Publication date: 31 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-87756-9_3

zbMATH Keywords

computational social choicepolynomial-time approximation schemepreference aggregationunavailable candidate model

Mathematics Subject Classification ID

Decision theory (91B06) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Social choice (91B14) Matching models (91B68)

Cites Work

• New candidates welcome! Possible winners with respect to the addition of new candidates
• Voting schemes for which it can be difficult to tell who won the election
• A weighted Kendall's tau statistic
• Voting by successive elimination and strategic candidacy
• A distance measure for choice functions
• Assent-maximizing social choice
• New Results on Equilibria in Strategic Candidacy
• Strategic Candidacy and Voting Procedures
• On probability models in voting theory
• Handbook of Computational Social Choice

This page was built for publication: Preference aggregation in the generalised unavailable candidate model