English
Related papers

Related papers: When Effort May Fail: Equilibria of Shared Effort …

200 papers

It is well known that a non-cooperative game may have multiple equilibria. In this paper we consider the efficiency of games, measured by the ratio between the aggregate payoff over all Nash equilibria and that over all admissible controls.…

Computer Science and Game Theory · Computer Science 2025-08-20 Jianfeng Zhang

Game-theoretic techniques and equilibria analysis facilitate the design and verification of competitive systems. While algorithmic complexity of equilibria computation has been extensively studied, practical implementation and application…

Computer Science and Game Theory · Computer Science 2022-02-02 Marta Kwiatkowska , Gethin Norman , David Parker , Gabriel Santos

We study stable matching problems in networks where players are embedded in a social context, and may incorporate friendship relations or altruism into their decisions. Each player is a node in a social network and strives to form a good…

Computer Science and Game Theory · Computer Science 2012-04-27 Elliot Anshelevich , Onkar Bhardwaj , Martin Hoefer

We address the question of whether price of stability results (existence of equilibria with low social cost) are robust to incomplete information. We show that this is the case in potential games, if the underlying algorithmic social cost…

Computer Science and Game Theory · Computer Science 2015-03-13 Vasilis Syrgkanis

We investigate the existence of certain types of equilibria (Nash, $\varepsilon$-Nash, subgame perfect, $\varepsilon$-subgame perfect, Pareto-optimal) in multi-player multi-outcome infinite sequential games. We use two fundamental…

Logic in Computer Science · Computer Science 2016-03-18 Stéphane Le Roux , Arno Pauly

We consider the interaction among agents engaging in a driving task and we model it as general-sum game. This class of games exhibits a plurality of different equilibria posing the issue of equilibrium selection. While selecting the most…

In a multi-objective game, each individual's payoff is a \emph{vector-valued} function of everyone's actions. Under such vectorial payoffs, Pareto-efficiency is used to formulate each individual's best-response condition, inducing…

Computer Science and Game Theory · Computer Science 2018-09-14 Anisse Ismaili

We study a class of stochastic dynamic games that exhibit strategic complementarities between players; formally, in the games we consider, the payoff of a player has increasing differences between her own state and the empirical…

Computer Science and Game Theory · Computer Science 2010-12-13 Sachin Adlakha , Ramesh Johari

Frequent violations of fair principles in real-life settings raise the fundamental question of whether such principles can guarantee the existence of a self-enforcing equilibrium in a free economy. We show that elementary principles of…

Theoretical Economics · Economics 2021-07-28 Ghislain H. Demeze-Jouatsa , Roland Pongou , Jean-Baptiste Tondji

We consider mean field games with discrete state spaces (called discrete mean field games in the following) and we analyze these games in continuous and discrete time, over finite as well as infinite time horizons. We prove the existence of…

Optimization and Control · Mathematics 2019-09-04 Josu Doncel , Nicolas Gast , Bruno Gaujal

How do rational agents self-organize when trying to connect to a common target? We study this question with a simple tree formation game which is related to the well-known fair single-source connection game by Anshelevich et al. (FOCS'04)…

Computer Science and Game Theory · Computer Science 2020-09-24 Davide Bilò , Tobias Friedrich , Pascal Lenzner , Anna Melnichenko , Louise Molitor

Shared-constraint games are noncooperative $N$-player games where players are coupled through a common coupling constraint. It is known that such games admit two kinds of equilibria -- generalized Nash equilibria (GNE) and variational…

Computer Science and Game Theory · Computer Science 2019-08-05 Ankur A. Kulkarni

Games with incomplete preferences are an important model for studying rational decision-making in scenarios where players face incomplete information about their preferences and must contend with incomparable outcomes. We study the problem…

Computer Science and Game Theory · Computer Science 2024-08-13 Abhishek N. Kulkarni , Jie Fu , Ufuk Topcu

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

The latest developments in AI focus on agentic systems where artificial and human agents cooperate to realize global goals. An example is collaborative learning, which aims to train a global model based on data from individual agents. A…

Computer Science and Game Theory · Computer Science 2025-08-20 Björn Filter , Ralf Möller , Özgür Lütfü Özçep

Federated learning is a distributed learning paradigm where multiple agents, each only with access to local data, jointly learn a global model. There has recently been an explosion of research aiming not only to improve the accuracy rates…

Computer Science and Game Theory · Computer Science 2021-06-18 Kate Donahue , Jon Kleinberg

Measuring individual productivity (or equivalently distributing the overall productivity) in a network structure of workers displaying peer effects has been a subject of ongoing interest in many areas ranging from academia to industry. In…

Computer Science and Game Theory · Computer Science 2024-02-07 N. Allouch , Luis A. Guardiola , A. Meca

It is well known that a game equilibrium can be far from efficient or fair, due to the misalignment between individual and social objectives. The focus of this paper is to design a new mechanism framework that induces an efficient and fair…

Computer Science and Game Theory · Computer Science 2017-08-11 Lin Gao , Jianwei Huang

We study a class of non-cooperative aggregative games -- denoted as \emph{social purpose games} -- in which the payoffs depend separately on a player's own strategy (individual benefits) and on a function of the strategy profile which is…

Computer Science and Game Theory · Computer Science 2021-09-20 Robert P. Gilles , Lina Mallozzi , Roberta Messalli

Today's multiagent systems have grown too complex to rely on centralized controllers, prompting increasing interest in the design of distributed algorithms. In this respect, game theory has emerged as a valuable tool to complement more…

Systems and Control · Computer Science 2020-02-19 Rahul Chandan , Dario Paccagnan , Jason R. Marden