English
Related papers

Related papers: Optimizing Voting Order on Sequential Juries: A Me…

200 papers

When allocating indivisible items to agents, it is known that the only strategyproof mechanisms that satisfy a set of rather mild conditions are constrained serial dictatorships: given a fixed order over agents, at each step the designated…

Computer Science and Game Theory · Computer Science 2025-02-28 Sylvain Bouveret , Hugo Gilbert , Jérôme Lang , Guillaume Méroué

The goal of multi-winner elections is to choose a fixed-size committee based on voters' preferences. An important concern in this setting is representation: large groups of voters with cohesive preferences should be adequately represented…

Computer Science and Game Theory · Computer Science 2025-12-10 Luis Sánchez-Fernández , Edith Elkind , Martin Lackner , Norberto Fernández , Jesús A. Fisteus , Pablo Basanta Val , Piotr Skowron

The voting method, an ensemble approach for fundamental frequency estimation, is empirically known for its robustness but lacks thorough investigation. This paper provides a principled analysis and improvement of this technique. First, we…

Sound · Computer Science 2026-02-03 Junya Koguchi , Tomoki Koriyama

Multiwinner voting rules can be used to select a fixed-size committee from a larger set of candidates. We consider approval-based committee rules, which allow voters to approve or disapprove candidates. In this setting, several voting rules…

Computer Science and Game Theory · Computer Science 2024-11-05 Dominik Peters

We study a model of a population making a binary decision based on information spreading within the population, which is fully connected or covering a square grid. We assume that a fraction of the population wants to make the choice of the…

Physics and Society · Physics 2016-05-24 Petter Holme , Hang-Hyun Jo

We study two notions of stability in multiwinner elections that are based on the Condorcet criterion. The first notion was introduced by Gehrlein: A committee is stable if each committee member is preferred to each non-member by a (possibly…

Computer Science and Game Theory · Computer Science 2017-01-30 Haris Aziz , Edith Elkind , Piotr Faliszewski , Martin Lackner , Piotr Skowron

In an election where $n$ voters rank $m$ candidates, a Condorcet winning set is a committee of $k$ candidates such that for any outside candidate, a majority of voters prefer some committee member. Condorcet's paradox shows that some…

Computer Science and Game Theory · Computer Science 2026-04-23 Itai Zilberstein , Ratip Emin Berker , George Li , Ruben Martins

In the impartial selection problem, a subset of agents up to a fixed size $k$ among a group of $n$ is to be chosen based on votes cast by the agents themselves. A selection mechanism is impartial if no agent can influence its own chance of…

Computer Science and Game Theory · Computer Science 2024-08-06 Javier Cembrano , Svenja M. Griesbach , Maximilian J. Stahlberg

We show that it can be suboptimal for Bayesian decision-making agents employing social learning to use correct prior probabilities as their initial beliefs. We consider sequential Bayesian binary hypothesis testing where each individual…

Information Theory · Computer Science 2026-03-12 Joong Bum Rhim , Vivek K Goyal

The commitment power of senders distinguishes Bayesian persuasion problems from other games with (strategic) communication. Persuasion games with multiple senders have largely studied simultaneous commitment and signalling settings.…

Theoretical Economics · Economics 2022-02-15 Shih-Tang Su , Vijay G. Subramanian

We show how hidden interesting subelections can be discovered in ordinal elections. An interesting subelection consists of a reasonably large set of voters and a reasonably large set of candidates such that the former have a consistent…

Computer Science and Game Theory · Computer Science 2024-07-29 Łukasz Janeczko , Jérôme Lang , Grzegorz Lisowski , Stanisław Szufa

For a voting ensemble that selects an odd-sized subset of the ensemble classifiers at random for each example, applies them to the example, and returns the majority vote, we show that any number of voters may minimize the error rate over an…

Machine Learning · Computer Science 2021-04-27 Eric Bax

We consider multi-agent systems where agents' preferences are aggregated via sequential majority voting: each decision is taken by performing a sequence of pairwise comparisons where each comparison is a weighted majority vote among the…

Artificial Intelligence · Computer Science 2012-04-18 Maria Pini , Francesca Rossi , Brent Venable , Toby Walsh

Proponents of Condorcet voting face the question of what to do in the rare case when no Condorcet winner exists. Recent work provides compelling arguments for the rule that should be applied in three-candidate elections, but already with…

Theoretical Economics · Economics 2025-09-16 Wesley H. Holliday

Peer review lies at the core of the academic process, but even well-intentioned reviewers can still provide noisy ratings. While ranking papers by average ratings may reduce noise, varying noise levels and systematic biases stemming from…

Computer Science and Game Theory · Computer Science 2023-12-13 Yuxuan Lu , Yuqing Kong

Peer prediction mechanisms incentivize agents to truthfully report their signals even in the absence of verification by comparing agents' reports with those of their peers. In the detail-free multi-task setting, agents respond to multiple…

Computer Science and Game Theory · Computer Science 2021-08-27 Grant Schoenebeck , Fang-Yi Yu

A population of voters must elect representatives among themselves to decide on a sequence of possibly unforeseen binary issues. Voters care only about the final decision, not the elected representatives. The disutility of a voter is…

Computer Science and Game Theory · Computer Science 2020-06-16 Reshef Meir , Fedor Sandomirskiy , Moshe Tennenholtz

We consider a voting model, where a number of candidates need to be selected subject to certain feasibility constraints. The model generalises committee elections (where there is a single constraint on the number of candidates that need to…

Computer Science and Game Theory · Computer Science 2025-09-24 Tomáš Masařík , Grzegorz Pierczyński , Piotr Skowron

Agents vote to choose a fair mixture of public outcomes; each agent likes or dislikes each outcome. We discuss three outstanding voting rules. The Conditional Utilitarian rule, a variant of the random dictator, is Strategyproof and…

Computer Science and Game Theory · Computer Science 2017-12-08 Haris Aziz , Anna Bogomolnaia , Herve Moulin

We study a game theoretic model of standardized testing for college admissions. Students are of two types; High and Low. There is a college that would like to admit the High type students. Students take a potentially costly standardized…

Computer Science and Game Theory · Computer Science 2021-02-17 Sampath Kannan , Mingzi Niu , Aaron Roth , Rakesh Vohra
‹ Prev 1 4 5 6 7 8 10 Next ›