English
Related papers

Related papers: Efficiency of equilibria in games with random payo…

200 papers

We study the problem of checking for the existence of constrained pure Nash equilibria in a subclass of polymatrix games defined on weighted directed graphs. The payoff of a player is defined as the sum of nonnegative rational weights on…

Computer Science and Game Theory · Computer Science 2016-11-30 Sunil Simon , Dominik Wojtczak

We analyze the performance of the best-response dynamic across all normal-form games using a random games approach. The playing sequence -- the order in which players update their actions -- is essentially irrelevant in determining whether…

Theoretical Economics · Economics 2022-11-18 Torsten Heinrich , Yoojin Jang , Luca Mungo , Marco Pangallo , Alex Scott , Bassel Tarbush , Samuel Wiese

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

The standard game-theoretic solution concept, Nash equilibrium, assumes that all players behave rationally. If we follow a Nash equilibrium and opponents are irrational (or follow strategies from a different Nash equilibrium), then we may…

Computer Science and Game Theory · Computer Science 2023-08-22 Sam Ganzfried

We introduce a new non-zero-sum game of optimal stopping with asymmetric exercise opportunities. Given a stochastic process modelling the value of an asset, one player observes and can act on the process continuously, while the other player…

Probability · Mathematics 2024-05-16 José Luis Pérez , Neofytos Rodosthenous , Kazutoshi Yamazaki

We study a class of games which model the competition among agents to access some service provided by distributed service units and which exhibit congestion and frustration phenomena when service units have limited capacity. We propose a…

Computer Science and Game Theory · Computer Science 2015-08-19 F. Altarelli , A. Braunstein , L. Dall'Asta

Aggregative games have many industrial applications, and computing an equilibrium in those games is challenging when the number of players is large. In the framework of atomic aggregative games with coupling constraints, we show that…

Computer Science and Game Theory · Computer Science 2020-03-27 Paulin Jacquot , Cheng Wan , Olivier Beaude , Nadia Oudjane

We study the equilibrium distribution of relative strategy scores of agents in the asymmetric phase ($\alpha\equiv P/N\gtrsim 1$) of the basic Minority Game using sign-payoff, with $N$ agents holding two strategies over $P$ histories. We…

Disordered Systems and Neural Networks · Physics 2016-08-31 Mats Granath , Alvaro Perez-Diaz

We study a nonzero-sum game of two players which is a generalization of the antagonistic noisy duel of discrete type. The game is considered from the point of view of various criterions of optimality. We prove existence of…

Optimization and Control · Mathematics 2007-08-18 Lyubov N. Positselskaya

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

We investigate the problem of equilibrium computation for "large" $n$-player games. Large games have a Lipschitz-type property that no single player's utility is greatly affected by any other individual player's actions. In this paper, we…

Computer Science and Game Theory · Computer Science 2016-10-28 Paul W. Goldberg , Francisco J. Marmolejo-Cossío , Zhiwei Steven Wu

In this paper we propose a Bayesian game to allocate resources. In this game, there are $c$ units of resources to be allocated to $n$ players. Agent $i$ has a demand of $V_i$ units of resources and takes action $X_i$ according to a strategy…

Computer Science and Game Theory · Computer Science 2026-05-12 Duan-Shin Lee

This paper considers a time-varying game with $N$ players. Every time slot, players observe their own random events and then take a control action. The events and control actions affect the individual utilities earned by each player. The…

Computer Science and Game Theory · Computer Science 2014-02-04 Michael J. Neely

In cost sharing games, the existence and efficiency of pure Nash equilibria fundamentally depends on the method that is used to share the resources' costs. We consider a general class of resource allocation problems in which a set of…

Computer Science and Game Theory · Computer Science 2015-02-05 Max Klimm , Daniel Schmand

We show that in any $n$-player $m$-action normal-form game, we can obtain an approximate equilibrium by sampling any mixed-action equilibrium a small number of times. We study three types of equilibria: Nash, correlated and coarse…

Computer Science and Game Theory · Computer Science 2014-10-21 Yakov Babichenko , Siddharth Barman , Ron Peretz

Winners-take-all situations introduce an incentive for agents to diversify their behavior, since doing so will result in splitting an eventual price with fewer people. At the same time, when the payoff of a process depends on a parameter…

Computer Science and Game Theory · Computer Science 2019-06-11 Abel Molina

We propose a general class of symmetric games called position-optimization games. Given a probability distribution $Q$ over a set of targets $\mathcal{Y}$, the $n$ players each choose a position in a space $\mathcal{X}$. A player's utility…

Computer Science and Game Theory · Computer Science 2026-02-18 Rafael Frongillo , Melody Hsu , Mary Monroe , Anish Thilagar

We consider two classes of constrained finite state-action stochastic games. First, we consider a two player nonzero sum single controller constrained stochastic game with both average and discounted cost criterion. We consider the same…

Optimization and Control · Mathematics 2012-06-11 Vikas Vikram Singh , N. Hemachandra

We provide an in-depth study of Nash equilibria in multi-objective normal form games (MONFGs), i.e., normal form games with vectorial payoffs. Taking a utility-based approach, we assume that each player's utility can be modelled with a…

Computer Science and Game Theory · Computer Science 2022-07-19 Willem Röpke , Diederik M. Roijers , Ann Nowé , Roxana Rădulescu

In the context of large population symmetric games, approximate Nash equilibria are introduced through equilibrium solutions of the corresponding mean field game in the sense that the individual gain from optimal unilateral deviation under…

Computer Science and Game Theory · Computer Science 2026-01-30 Mao Fabrice Djete , Nizar Touzi