English
Related papers

Related papers: Sequential Elimination Voting Games

200 papers

Strategic voting, or manipulation, is the process by which a voter misrepresents his preferences in an attempt to elect an outcome that he considers preferable to the outcome under sincere voting. It is generally agreed that manipulation is…

Computer Science and Game Theory · Computer Science 2022-11-10 Egor Ianovski , Daria Teplova , Valeriia Kuka

In the traditional voting manipulation literature, it is assumed that a group of manipulators jointly misrepresent their preferences to get a certain candidate elected, while the remaining voters are truthful. In this paper, we depart from…

Computer Science and Game Theory · Computer Science 2010-01-28 Yvo Desmedt , Edith Elkind

We study the computational complexity of strategic behaviour in primary elections. Unlike direct voting systems, primaries introduce a multi-stage process in which voters first influence intra-party nominees before a general election…

Computer Science and Game Theory · Computer Science 2026-02-12 Colin Cleveland , Bart de Keijzer , Maria Polukarov

This paper introduces an equilibrium framework based on sequential sampling in which players face strategic uncertainty over their opponents' behavior and acquire informative signals to resolve it. Sequential sampling equilibrium delivers a…

Theoretical Economics · Economics 2023-11-03 Duarte Gonçalves

In large scale collective decision making, social choice is a normative study of how one ought to design a protocol for reaching consensus. However, in instances where the underlying decision space is too large or complex for ordinal…

Computer Science and Game Theory · Computer Science 2017-10-03 Brandon Fain , Ashish Goel , Kamesh Munagala , Sukolsak Sakshuwong

We study a stochastic process that mimics single-game elimination tournaments. In our model, the outcome of each match is stochastic: the weaker player wins with upset probability q<=1/2, and the stronger player wins with probability 1-q.…

Statistical Mechanics · Physics 2007-05-23 E. Ben-Naim , S. Redner , F. Vazquez

The voting process is formalized as a multistage voting model with successive alternative elimination. A finite number of agents vote for one of the alternatives each round subject to their preferences. If the number of votes given to the…

Optimization and Control · Mathematics 2018-08-01 Oleg A. Malafeyev , Denis Rylow , Irina Zaitseva , Anna Ermakova , Dmitry Shlaev

An extensive literature in economics and social science addresses contests, in which players compete to outperform each other on some measurable criterion, often referred to as a player's score, or output. Players incur costs that are an…

Computer Science and Game Theory · Computer Science 2013-08-01 Leslie Ann Goldberg , Paul W. Goldberg , Piotr Krysta , Carmine Ventre

Most work on manipulation assumes that all preferences are known to the manipulators. However, in many settings elections are open and sequential, and manipulators may know the already cast votes but may not know the future votes. We…

Computer Science and Game Theory · Computer Science 2013-10-28 Edith Hemaspaandra , Lane A. Hemaspaandra , Joerg Rothe

We introduce a new measure of the discrepancy in strategic games between the social welfare in a Nash equilibrium and in a social optimum, that we call selfishness level. It is the smallest fraction of the social welfare that needs to be…

Computer Science and Game Theory · Computer Science 2014-04-04 Krzysztof R. Apt , Guido Schaefer

Most work on manipulation assumes that all preferences are known to the manipulators. However, in many settings elections are open and sequential, and manipulators may know the already cast votes but may not know the future votes. We…

Computer Science and Game Theory · Computer Science 2015-03-20 Edith Hemaspaandra , Lane A. Hemaspaandra , Joerg Rothe

Strategic classification studies the problem where self-interested individuals or agents manipulate their response to obtain favorable decision outcomes made by classifiers, typically turning to dishonest actions when they are less costly…

Machine Learning · Computer Science 2026-05-07 Ziyuan Huang , Lina Alkarmi , Mingyan Liu

Machine learning relies on the assumption that unseen test instances of a classification problem follow the same distribution as observed training data. However, this principle can break down when machine learning is used to make important…

Machine Learning · Computer Science 2015-11-24 Moritz Hardt , Nimrod Megiddo , Christos Papadimitriou , Mary Wootters

In repeated-game applications where both the collusive and non-collusive outcomes can be supported as equilibria, researchers must resolve underlying selection questions if theory will be used to understand counterfactual policies. One…

General Economics · Economics 2021-01-18 Emanuel Vespa , Taylor Weidman , Alistair J. Wilson

A negotiating team is a group of two or more agents who join together as a single negotiating party because they share a common goal related to the negotiation. Since a negotiating team is composed of several stakeholders, represented as a…

Computer Science and Game Theory · Computer Science 2021-08-03 Leora Schmerler , Noam Hazon

We study the quality of outcomes in repeated games when the population of players is dynamically changing and participants use learning algorithms to adapt to the changing environment. Game theory classically considers Nash equilibria of…

Computer Science and Game Theory · Computer Science 2020-05-25 Thodoris Lykouris , Vasilis Syrgkanis , Eva Tardos

Two straightforward methods to extend an assessment of individual elements to groups are to sum individual assessments or to treat the group as a single merged element and assess it accordingly. In this work, we analyze another natural…

Computer Science and Game Theory · Computer Science 2026-05-21 Piotr Kępczyński , Oskar Skibski

An electoral spoiler is usually defined as a losing candidate whose removal would affect the outcome by changing the winner. So far, spoiler effects have been analyzed primarily for single-winner electoral systems. We consider this subject…

Computer Science and Game Theory · Computer Science 2025-10-30 Daria Boratyn , Wojciech Słomczyński , Dariusz Stolicki , Stanisław Szufa

This thesis considers sequential decision problems, where the loss/reward incurred by selecting an action may not be inferred from observed feedback. A major part of this thesis focuses on the unsupervised sequential selection problem,…

Machine Learning · Computer Science 2022-12-23 Arun Verma

This thesis considers sequential decision problems, where the loss/reward incurred by selecting an action may not be inferred from observed feedback. A major part of this thesis focuses on the unsupervised sequential selection problem,…

Machine Learning · Computer Science 2023-01-30 Arun Verma
‹ Prev 1 2 3 10 Next ›