paper-with-me

Papers

Sequential unanimity voting rules for binary social choice

2024-02-20 · Stergios Athanasoglou, Somouaoga Bonkoungou

We consider a group of voters that needs to decide between two candidates. We propose a novel family of neutral and strategy-proof rules, which we call sequential unanimity rules. By demonstrating their formal equivalence to the M-winning coalition rules of Moulin (1983), we show that sequential unanimity rules are characterized by neutrality and strategy-proofness. We establish our results by developing algorithms that transform a given M-winning coalition rule into an equivalent sequential unanimity rule and vice versa. The analysis can be extended to accommodate the full preference domain in which voters may be indifferent between candidates.

📄 PDF Abstract BibTeX arXiv:2402.13009

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Anonymous and Strategy-Proof Voting under Subjective Expected Utility Preferences

2024-01-08 · Eric Bahel

We study three axioms in the model of constrained social choice under uncertainty where (i) agents have subjective expected utility preferences over acts and (ii) different states of nature have (possibly) different sets…

What Voting Rules Actually Do: A Data-Driven Analysis of Multi-Winner Voting

2025-08-08 · Joshua Caiata, Ben Armstrong, Kate Larson arxiv

Committee-selection problems arise in many contexts and applications, and there has been increasing interest within the social choice research community on identifying which properties are satisfied by different multi-wi…

New Results on Equilibria in Strategic Candidacy

2013-06-07 · Jérôme Lang, Nicolas Maudet, Maria Polukarov, Alice Cohen-Hadria

We consider a voting setting where candidates have preferences about the outcome of the election and are free to join or leave the election. The corresponding candidacy game, where candidates choose strategically to part…

Optimal majority rules and quantitative Condorcet properties of setwise Kemeny voting schemes

2023-04-28 · Xuan Kien Phung, Sylvie Hamel

The important Kemeny problem, which consists of computing median consensus rankings of an election with respect to the Kemeny voting rule, admits important applications in biology and computational social choice and was …

Committee Selection with Attribute Level Preferences

2019-01-29 · Venkateswara Rao Kagita, Arun K Pujari, Vineet Padmanabhan, Vikas Kumar

We consider the problem of committee selection from a fixed set of candidates where each candidate has multiple quantifiable attributes. To select the best possible committee, instead of voting for a candidate, a voter i…

Attribute