English
Related papers

Related papers: Voting with Coarse Beliefs

200 papers

We study positional voting rules when candidates and voters are embedded in a common metric space, and cardinal preferences are naturally given by distances in the metric space. In a positional voting rule, each candidate receives a score…

Computer Science and Game Theory · Computer Science 2017-11-22 Yu Cheng , Shaddin Dughmi , David Kempe

Voting systems typically treat all voters equally. We argue that perhaps they should not: Voters who have supported good choices in the past should be given higher weight than voters who have supported bad ones. To develop a formal…

Computer Science and Game Theory · Computer Science 2017-03-16 Nika Haghtalab , Ritesh Noothigattu , Ariel D. Procaccia

Priority-based allocation of individuals to positions are pervasive, and elimination of justified envy is often, an absolute requirement. This leaves serial dictatorship (SD) as the only rule that avoids justified envy under standard direct…

Theoretical Economics · Economics 2026-05-22 Inácio Bó , Gian Caspari , Manshu Khanna

The game of best choice (or "secretary problem") is a model for making an irrevocable decision among a fixed number of candidate choices that are presented sequentially in random order, one at a time. Because the classically optimal…

Combinatorics · Mathematics 2021-07-14 Brant Jones , Katelynn D. Kochalski , Sarah Loeb , Julia C. Walk

Game semantics extends the Curry-Howard isomorphism to a three-way correspondence: proofs, programs, strategies. But the universe of strategies goes beyond intuitionistic logics and lambda calculus, to capture stateful programs. In this…

Logic in Computer Science · Computer Science 2013-07-09 Martin Churchill , Jim Laird , Guy McCusker

In this paper, we present a private voting system that consists of N authorized voters who may vote to one of the K candidates or vote abstain. Each voter wants to compute the final tally while staying private and robust against malicious…

Information Theory · Computer Science 2022-03-15 Seyed Reza Hoseini Najarkolaei , Narges Kazempour , Hasti Rostami , Mohammad Reza Aref

We consider distributed elections, where there is a center and $k$ sites. In such distributed elections, each voter has preferences over some set of candidates, and each voter is assigned to exactly one site such that each site is aware…

Computer Science and Game Theory · Computer Science 2019-07-24 Arnold Filtser , Nimrod Talmon

In approval-based multiwinner voting, voters express approval preferences over a set of candidates, and the goal is to return a winning committee. This model captures a broad range of subset selection problems under preferences. Prior work…

Computer Science and Game Theory · Computer Science 2026-04-28 Niclas Boehmer , Luca Kreisel , Jannik Peters

We introduce a new logic of graded distributed belief that allows us to express the fact that a group of agents distributively believe that a certain fact holds with at least strength k. We interpret our logic by means of computationally…

Logic in Computer Science · Computer Science 2025-12-01 Emiliano Lorini , Dmitry Rozplokhas

Consider an election between k candidates in which each voter votes randomly (but not necessarily independently) and suppose that there is a single candidate that every voter prefers (in the sense that each voter is more likely to vote for…

Probability · Mathematics 2012-05-31 Joe Neeman

Condorcet's paradox is a fundamental result in social choice theory which states that there exist elections in which, no matter which candidate wins, a majority of voters prefer a different candidate. In fact, even if we can select any $k$…

Computer Science and Game Theory · Computer Science 2025-12-02 Moses Charikar , Prasanna Ramakrishnan , Kangning Wang

A fundamental principle of individual rational choice is Sen's $\gamma$ axiom, also known as expansion consistency, stating that any alternative chosen from each of two menus must be chosen from the union of the menus. Expansion consistency…

Theoretical Economics · Economics 2023-03-28 Wesley H. Holliday , Chase Norman , Eric Pacuit , Saam Zahedian

Consider an election between two candidates in which the voters' choices are random and independent and the probability of a voter choosing the first candidate is $p>1/2$. Condorcet's Jury Theorem which he derived from the weak law of large…

Probability · Mathematics 2007-05-23 Olle Haggstrom , Gil Kalai , Elchanan Mossel

We consider spatial voting where candidates are located in the Euclidean $d$-dimensional space, and each voter ranks candidates based on their distance from the voter's ideal point. We explore the case where information about the location…

Computer Science and Game Theory · Computer Science 2024-08-21 Aviram Imber , Jonas Israel , Markus Brill , Hadas Shachnai , Benny Kimelfeld

We focus on a generalization of the classic Minisum approval voting rule, introduced by Barrot and Lang (2016), and referred to as Conditional Minisum (CMS), for multi-issue elections with preferential dependencies. Under this rule, voters…

Computer Science and Game Theory · Computer Science 2025-06-10 Evangelos Markakis , Georgios Papasotiropoulos

The ability to measure the satisfaction of (groups of) voters is a crucial prerequisite for formulating proportionality axioms in approval-based participatory budgeting elections. Two common - but very different - ways to measure the…

Computer Science and Game Theory · Computer Science 2023-10-19 Markus Brill , Stefan Forster , Martin Lackner , Jan Maly , Jannik Peters

Participatory budgeting (PB) is a democratic paradigm whereby voters decide on a set of projects to fund with a limited budget. We consider PB in a setting where voters report ordinal preferences over projects and have (possibly) asymmetric…

Computer Science and Game Theory · Computer Science 2020-12-11 Haris Aziz , Barton E. Lee

In perpetual voting, multiple decisions are made at different moments in time. Taking the history of previous decisions into account allows us to satisfy properties such as proportionality over periods of time. In this paper, we consider…

Computer Science and Game Theory · Computer Science 2025-01-07 Alexander Kozachinskiy , Alexander Shen , Tomasz Steifer

Arrow's `impossibility' theorem asserts that there are no satisfactory methods of aggregating individual preferences into collective preferences in many complex situations. This result has ramifications in economics, politics, i.e., the…

Theoretical Economics · Economics 2019-09-18 T. Erber , M. J. Frank

Even though proportional representation is a fundamental goal in multiwinner voting and a plethora of proportionality notions has been introduced, the normative justifications for choosing one notion over another remain poorly understood.…

Computer Science and Game Theory · Computer Science 2026-05-07 Chris Dong , Jannik Peters
‹ Prev 1 8 9 10 Next ›