Related papers: Preventing Social Disappointment in Elections
A Condorcet winning set addresses the Condorcet paradox by selecting a few candidates--rather than a single winner--such that no unselected alternative is preferred to all of them by a majority of voters. This idea extends to…
We discuss voting scenarios in which the set of voters (agents) and the set of alternatives are the same; that is, voters select a single representative from among themselves. Such a scenario happens, for instance, when a committee selects…
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism design is the art of designing the rules of the game so that…
There is a class of models for pol/mil/econ bargaining and conflict that is loosely based on the Median Voter Theorem which has been used with great success for about 30 years. However, there are fundamental mathematical limitations to…
This paper introduces the Voting with Random Proposers (VRP) procedure to address the challenges of agenda manipulation in voting. In each round of VRP, a randomly selected proposer suggests an alternative that is voted on against the…
The integrity of elections is central to democratic systems. However, a myriad of malicious actors aspire to influence election outcomes for financial or political benefit. A common means to such ends is by manipulating perceptions of the…
Apportionment is the act of distributing the seats of a legislature among political parties (or states) in proportion to their vote shares (or populations). A famous impossibility by Balinski and Young (2001) shows that no apportionment…
This paper introduces Propose or Vote (PoV), a democratic procedure for collective decision-making and elections that does not rely on a central mechanism designer. In the first stage, members of a polity choose whether to become…
We revisit the recent breakthrough result of Gkatzelis et al. on (single-winner) metric voting, which showed that the optimal distortion of 3 can be achieved by a mechanism called Plurality Matching. The rule picks an arbitrary candidate…
We study single-candidate voting embedded in a metric space, where both voters and candidates are points in the space, and the distances between voters and candidates specify the voters' preferences over candidates. In the voting, each…
We introduce BallotRank, a ranked preference aggregation method derived from a modified PageRank algorithm. It is a Condorcet-consistent method without damping, and empirical examination of nearly 2,000 ranked choice elections and over…
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism design is the art of designing the rules of the game so that…
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…
Emerging methods for participatory algorithm design have proposed collecting and aggregating individual stakeholder preferences to create algorithmic systems that account for those stakeholders' values. Using algorithmic student assignment…
In the computational social choice literature, there has been great interest in understanding how computational complexity can act as a barrier against manipulation of elections. Much of this literature, however, makes the assumption that…
A large amount of literature in social choice theory deals with quantifying the probability of certain election outcomes. One way of computing the probability of a specific voting situation under the Impartial Anonymous Culture assumption…
The outcomes of democratic elections rest on individuals' decision-making that is driven by their varying preferences and beliefs. Individuals may prefer consensus to gridlock, or gridlock to consensus, and information may be fractured via…
Approval voting is widely used for making multi-winner voting decisions. The canonical rule (also called Approval Voting) used in the setting aims to maximize social welfare by selecting candidates with the highest number of approvals. We…
We consider elections where both voters and candidates can be associated with points in a metric space and voters prefer candidates that are closer to those that are farther away. It is often assumed that the optimal candidate is the one…
A Condorcet cycle election is an election (often called a Social Welfare Function, or SWF) between three candidates, where each voter ranks the three candidates according to a fixed cyclic order. Maskin showed that if such a SWF obeys the…