中文
相关论文

相关论文: Manipulability of consular election rules

200 篇论文

In party-approval multiwinner elections the goal is to allocate the seats of a fixed-size committee to parties based on the approval ballots of the voters over the parties. In particular, each voter can approve multiple parties and each…

计算机科学与博弈论 · 计算机科学 2022-11-28 Théo Delemazure , Tom Demeulemeester , Manuel Eberl , Jonas Israel , Patrick Lederer

This paper studies a general class of social choice problems in which agents' payoff functions (or types) are privately observable random variables, and monetary transfers are not available. We consider cardinal social choice functions…

理论经济学 · 经济学 2024-08-20 Kazuya Kikuchi , Yukio Koriyama

We consider the allocation of indivisible objects when agents have preferences over their own allocations, but share the ownership of the resources to be distributed. Examples might include seats in public schools, faculty offices, and time…

理论经济学 · 经济学 2021-09-07 Mustafa Oğuz Afacan , Inácio Bó

Arrow's celebrated Impossibility Theorem asserts that an election rule, or Social Welfare Function (SWF), between three or more candidates meeting a set of strict criteria cannot exist. Maskin suggests that Arrow's conditions for SWFs are…

计算机科学与博弈论 · 计算机科学 2025-11-05 Gabriel Gendler

The election, a cornerstone of democracy, is one of the best-recognizable symbols of democratic governance. Voters' confidence in elections is essential, and these days, we can watch practically in live broadcast what consequences distrust…

密码学与安全 · 计算机科学 2024-03-12 Šimon Schierreich

The purpose of this note is to prove the existence of a randomized mechanism, a social decision scheme (SDS), with desirable fairness, efficiency, and strategyproofness properties unmatched by all known SDSs. In particular, we disprove a…

计算机科学与博弈论 · 计算机科学 2014-11-27 Florian Brandl

Arrow's Impossibility Theorem is a seminal result of Social Choice Theory that demonstrates the impossibility of ranked-choice decision-making processes to jointly satisfy a number of intuitive and seemingly desirable constraints. The…

理论经济学 · 经济学 2026-04-07 Ori Livson , Mikhail Prokopenko

Arrow's Impossibility Theorem establishes bounds on what we can require from voting systems. Given satisfaction of a small collection of "fairness" axioms, it shows votes can only exist as dictatorships in which one voter determines all…

逻辑 · 数学 2023-11-17 Alex Hall

Schulze and ranked-pairs elections have received much attention recently, and the former has quickly become a quite widely used election system. For many cases these systems have been proven resistant to bribery, control, or manipulation,…

计算机科学与博弈论 · 计算机科学 2014-06-24 Lane A. Hemaspaandra , Rahman Lavaee , Curtis Menton

Integrity of elections is vital to democratic systems, but it is frequently threatened by malicious actors. The study of algorithmic complexity of the problem of manipulating election outcomes by changing its structural features is known as…

计算机科学与博弈论 · 计算机科学 2020-07-21 Andrew Estornell , Sanmay Das , Edith Elkind , Yevgeniy Vorobeychik

We study conditions for the existence of stable and group-strategy-proof mechanisms in a many-to-one matching model with contracts if students' preferences are monotone in contract terms. We show that "equivalence", properly defined, to a…

理论经济学 · 经济学 2021-07-13 Jan Christoph Schlegel

Arrow's Impossibility Theorem states that any constitution which satisfies Independence of Irrelevant Alternatives (IIA) and Unanimity and is not a Dictator has to be non-transitive. In this paper we study quantitative versions of Arrow…

概率论 · 数学 2009-10-05 Elchanan Mossel

In a voting problem with a finite set of alternatives to choose from, we study the manipulation of tops-only rules. Since all non-dictatorial (onto) voting rules are manipulable when there are more than two alternatives and all preferences…

理论经济学 · 经济学 2022-10-24 R. Pablo Arribillaga , Agustin G. Bonifacio

In the realm of algorithmic economics, voting systems are evaluated and compared by examining the properties or axioms they satisfy. While this pursuit has yielded valuable insights, it has also led to seminal impossibility results such as…

计算机科学与博弈论 · 计算机科学 2023-09-07 Ethan Dickey , Aidan Casey

Classical results in voting theory show that strategic manipulation by voters is inevitable if a voting rule simultaneously satisfy certain desirable properties. Motivated by this, we study the relevant question of how often a voting rule…

计算机科学与博弈论 · 计算机科学 2015-02-17 Palash Dey , Y. Narahari

May's Theorem (1952), a celebrated result in social choice, provides the foundation for majority rule. May's crucial assumption of symmetry, often thought of as a procedural equity requirement, is violated by many choice procedures that…

理论经济学 · 经济学 2020-09-01 Laurent Bartholdi , Wade Hann-Caruthers , Maya Josyula , Omer Tamuz , Leeat Yariv

Manipulation models for electoral systems are a core research theme in social choice theory; they include bribery (unweighted, weighted, swap, shift, ...), control (by adding or deleting voters or candidates), lobbying in referenda and…

多智能体系统 · 计算机科学 2018-01-30 Dušan Knop , Martin Koutecký , Matthias Mnich

We exhibit the hidden beauty of weighted voting and voting power by applying a generalization of the Penrose-Banzhaf index to social choice rules. Three players who have multiple votes in a committee decide between three options by…

计算机科学与博弈论 · 计算机科学 2022-08-01 Sascha Kurz , Alexander Mayer , Stefan Napel

The well-known Condorcet's Jury theorem posits that the majority rule selects the best alternative among two available options with probability one, as the population size increases to infinity. We study this result under an asymmetric…

计算机科学与博弈论 · 计算机科学 2024-08-02 Ganesh Ghalme , Reshef Meir

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 of available…

理论经济学 · 经济学 2024-08-05 Eric Bahel