English
Related papers

Related papers: How Good Is a Two-Party Election Game?

200 papers

We formulate two-party policy competition as a two-player non-cooperative game, generalizing Lin et al.'s work (2021). Each party selects a real-valued policy vector as its strategy from a compact subset of Euclidean space, and a voter's…

Computer Science and Game Theory · Computer Science 2026-03-19 Chuang-Chieh Lin , Chi-Jen Lu , Po-An Chen , Chih-Chieh Hung

We study strategic candidate nomination by parties in elections decided by Plurality voting. Each party selects a nominee before the election, and the winner is chosen from the nominated candidates based on the voters' preferences. We…

Computer Science and Game Theory · Computer Science 2025-11-17 Piotr Faliszewski , Stanislaw Kazmierowski , Grzegorz Lisowski , Ildiko Schlotter , Paolo Turrini

We study organizational elections in which each group nominates one candidate and receives as payoff its members expected utility under a probabilistic winning rule. We empirically justify a standard monotonicity assumption by simulating…

Computer Science and Game Theory · Computer Science 2026-02-06 Chuang-Chieh Lin , Chi-Jen Lu , Po-An Chen , Chih-Chieh Hung

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 a general scenario of simultaneous contests that allocate prizes based on equal sharing: each contest awards its prize to all players who satisfy some contest-specific criterion, and the value of this prize to a winner decreases as…

Computer Science and Game Theory · Computer Science 2022-07-19 Edith Elkind , Abheek Ghosh , Paul W. Goldberg

Entities in multi-agent systems may seek conflicting subobjectives, and this leads to competition between them. To address performance degradation due to competition, we consider a bi-level lottery where a social planner at the high level…

Computer Science and Game Theory · Computer Science 2020-12-04 Hunmin Kim , Minghui Zhu

We introduce a framework for studying the effect of cooperation on the quality of outcomes in utility games. Our framework is a coalitional analog of the smoothness framework of non-cooperative games. Coalitional smoothness implies bounds…

Computer Science and Game Theory · Computer Science 2013-07-10 Yoram Bachrach , Vasilis Syrgkanis , Eva Tardos , Milan Vojnovic

The efficiency of a game is typically quantified by the price of anarchy (PoA), defined as the worst ratio of the objective function value of an equilibrium --- solution of the game --- and that of an optimal outcome. Given the tremendous…

Computer Science and Game Theory · Computer Science 2017-08-23 Nguyen Kim Thang

We consider two competing platforms operating in a two-sided market and offering identical services to their customers at potentially different prices. The objective of each platform is to maximize its throughput or revenue by suitably…

Optimization and Control · Mathematics 2020-02-03 Mansi Sood , Ankur A. Kulkarni , Sharayu Moharir

This paper considers a two-player game where each player chooses a resource from a finite collection of options. Each resource brings a random reward. Both players have statistical information regarding the rewards of each resource.…

Computer Science and Game Theory · Computer Science 2023-09-19 Mevan Wijewardena , Michael J. Neely

We study optimal behavior of energy producers under a CO_2 emission abatement program. We focus on a two-player discrete-time model where each producer is sequentially optimizing her emission and production schedules. The game-theoretic…

Optimization and Control · Mathematics 2010-08-24 Michael Ludkovski

In this paper we study variations of the standard Hotelling-Downs model of spatial competition, where each agent attracts the clients in a restricted neighborhood, each client randomly picks one attractive agent for service. Two utility…

Computer Science and Game Theory · Computer Science 2016-11-21 Weiran Shen , Zihe Wang

We consider a symmetric two-player contest, in which the choice set of effort is constrained. We apply a fundamental property of the payoff function to show that, under standard assumptions, there exists a unique Nash equilibrium in pure…

Theoretical Economics · Economics 2020-09-15 Doron Klunover , John Morgan

We study assignment games in which jobs select machines, and in which certain pairs of jobs may conflict, which is to say they may incur an additional cost when they are both assigned to the same machine, beyond that associated with the…

Computer Science and Game Theory · Computer Science 2014-02-11 Elliot Anshelevich , John Postl , Tom Wexler

We study optimal equilibria in multi-player games. An equilibrium is optimal for a player, if her payoff is maximal. A tempting approach to solving this problem is to seek optimal Nash equilibria, the standard form of equilibria where no…

Computer Science and Game Theory · Computer Science 2013-07-09 Anshul Gupta , Sven Schewe

The all-pay auction, a classic competitive model, is widely applied in scenarios such as political elections, sports competitions, and research and development, where all participants pay their bids regardless of winning or losing. However,…

Theoretical Economics · Economics 2025-07-24 Yan Liu , Ying Qin , Zihe Wang

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

We study the inefficiency of mixed equilibria, expressed as the price of anarchy, of all-pay auctions in three different environments: combinatorial, multi-unit and single-item auctions. First, we consider item-bidding combinatorial…

Computer Science and Game Theory · Computer Science 2015-08-06 George Christodoulou , Alkmini Sgouritsa , Bo Tang

The Hotelling-Downs model is a natural and appealing model for understanding strategic positioning by candidates in elections. In this model, voters are distributed on a line, representing their ideological position on an issue. Each…

Computer Science and Game Theory · Computer Science 2024-12-18 Umang Bhaskar , Soumyajit Pyne

Some argue that political stability is best served through a two-party system. This study refutes this. The author mathematically defines the stability and rigidity of electoral systems comprised of any quantity of electors and parties. In…

Economics · Quantitative Finance 2016-08-18 Michael Y. Levy
‹ Prev 1 2 3 10 Next ›