English
Related papers

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

200 papers

Players allocate their budget to links, a local public good and a private good. A player links to free ride on others' public good provision. We derive sufficient conditions for the existence of a Nash equilibrium. In equilibrium, large…

Theoretical Economics · Economics 2023-01-16 Markus Kinateder , Luca Paolo Merlino

Two-player stochastic games are games with two 2 players and a randomised entity called "nature". A natural question to ask in this framework is the existence of strategies that ensure that an event happens with probability 1 (almost-sure…

Computer Science and Game Theory · Computer Science 2018-06-27 Youssouf Oualhadj , Léo Tible , Daniele Varacca

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

A recent body of experimental literature has studied empirical game-theoretical analysis, in which we have partial knowledge of a game, consisting of observations of a subset of the pure-strategy profiles and their associated payoffs to…

Computer Science and Game Theory · Computer Science 2014-02-13 John Fearnley , Martin Gairing , Paul Goldberg , Rahul Savani

The rise of automated bidding strategies in online advertising presents new challenges in designing and analyzing efficient auction mechanisms. In this paper, we focus on proportional mechanisms within the context of auto-bidding and study…

Computer Science and Game Theory · Computer Science 2026-04-27 Nguyen Kim Thang

Game theory is a very profound study on distributed decision-making behavior and has been extensively developed by many scholars. However, many existing works rely on certain strict assumptions such as knowing the opponent's private…

Computer Science and Game Theory · Computer Science 2020-04-21 Kuo Chun Tsai , Zhu Han

We study coordination mechanisms for Scheduling Games (with unrelated machines). In these games, each job represents a player, who needs to choose a machine for its execution, and intends to complete earliest possible. Our goal is to design…

Computer Science and Game Theory · Computer Science 2012-02-21 Johanne Cohen , Christoph Dürr , Nguyen Kim Thang

We use Hotelling's spatial model of competition to investigate the position-taking behaviour of political candidates under a class of electoral systems known as scoring rules. In a scoring rule election, voters rank all the candidates…

Computer Science and Game Theory · Computer Science 2013-01-03 Dodge Cahan , John McCabe-Dansted , Arkadii Slinko

This paper studies the performance of Mobile Ad hoc Networks (MANETs) when the nodes, that form a Poisson point process, selfishly choose their Medium Access Probability (MAP). We consider goodput and delay as the performance metric that…

Computer Science and Game Theory · Computer Science 2012-01-06 Manjesh Kumar Hanawal , Eitan Altman , Francois Baccelli

This paper tackles the problem of how two selfish users jointly determine the operating point in the achievable rate region of a two-user Gaussian interference channel through bargaining. In previous work, incentive conditions for two users…

Information Theory · Computer Science 2010-10-05 Xi Liu , Elza Erkip

We consider a scheduling game on parallel related machines, in which jobs try to minimize their completion time by choosing a machine to be processed on. Each machine uses an individual priority list to decide on the order according to…

Computer Science and Game Theory · Computer Science 2023-11-28 Vipin Ravindran Vijayalakshmi , Marc Schröder , Tami Tamir

Many real-world voting systems consist of voters that occur in just two different types. Indeed, each voting system with a {\lq\lq}House{\rq\rq} and a {\lq\lq}Senat{\rq\rq} is of that type. Here we present structural characterizations and…

Combinatorics · Mathematics 2021-12-02 Sascha Kurz , Dani Samaniego

In this paper we extend some recent results on an operatorial approach to the description of alliances between political parties interacting among themselves and with a basin of electors. In particular, we propose and compare three…

Physics and Society · Physics 2017-05-24 F. Bagarello , F. Gargano

We study the voting problem with two alternatives where voters' preferences depend on a not-directly-observable state variable. While equilibria in the one-round voting mechanisms lead to a good decision, they are usually hard to compute…

Computer Science and Game Theory · Computer Science 2025-05-16 Qishen Han , Grant Schoenebeck , Biaoshuai Tao , Lirong Xia

In this paper, we study a routing and travel-mode choice problem for mobility systems with a multimodal transportation network as a ``mobility game" with coupled action sets. We develop a game-theoretic framework to study the impact on…

Computer Science and Game Theory · Computer Science 2022-12-15 Ioannis Vasileios Chremos , Andreas A. Malikopoulos

The control of large-scale, multi-agent systems often entails distributing decision-making across the system components. However, with advances in communication and computation technologies, we can consider new collaborative decision-making…

Computer Science and Game Theory · Computer Science 2024-07-04 Bryce L. Ferguson , Dario Paccagnan , Bary S. R. Pradelski , Jason R. Marden

Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative) requirement that the sum of the weights (i.e., the level of…

Logic in Computer Science · Computer Science 2012-04-04 Krishnendu Chatterjee , Laurent Doyen

We analyze ways by which people decompose into groups in distributed systems. We are interested in systems in which an agent can increase its utility by connecting to other agents, but must also pay a cost that increases with the size of…

Computer Science and Game Theory · Computer Science 2013-05-21 Shay Kutten , Ron Lavi , Amitabh Trehan

Multiplayer games with selfish agents naturally occur in the design of distributed and embedded systems. As the goals of selfish agents are usually neither equivalent nor antagonistic to each other, such games are non zero-sum games. We…

Computer Science and Game Theory · Computer Science 2012-12-19 Thomas Brihaye , Julie De Pril , Sven Schewe

In this work we study of competitive situations among users of a set of global resources. More precisely we study the effect of cost policies used by these resources in the convergence time to a pure Nash equilibrium. The work is divided in…

Computer Science and Game Theory · Computer Science 2011-03-28 Vissarion Fisikopoulos