English
Related papers

Related papers: Equilibrium Refinement in Finite Action Evidence G…

200 papers

We study the problem of computing an $\epsilon$-Nash equilibrium in repeated games. Earlier work by Borgs et al. [2010] suggests that this problem is intractable. We show that if we make a slight change to their model---modeling the players…

Computer Science and Game Theory · Computer Science 2015-03-24 Joseph Y. Halpern , Rafael Pass , Lior Seeman

Mechanism design is addressed in the context of fair allocations of indivisible goods with monetary compensation. Motivated by a real-world social choice problem, mechanisms with verification are considered in a setting where (i) agents'…

Computer Science and Game Theory · Computer Science 2012-09-18 Gianluigi Greco , Francesco Scarcello

In the framework of finite games in extensive form with perfect information and strict preferences, this paper introduces a new equilibrium concept: the Perfect Prediction Equilibrium (PPE). In the Nash paradigm, rational players consider…

Computer Science and Game Theory · Computer Science 2021-02-01 Ghislain Fourny , Stéphane Reiche , Jean-Pierre Dupuy

It was shown in Flesch and Solan (2022) with a rather involved proof that all two-player stochastic games with finite state and action spaces and shift-invariant payoffs admit an $\epsilon$-equilibrium, for every $\epsilon>0$. Their proof…

Optimization and Control · Mathematics 2022-08-25 Galit Ashkenazi-Golan , János Flesch , Eilon Solan

We consider a stochastic tournament game in which each player is rewarded based on her rank in terms of the completion time of her own task and is subject to cost of effort. When players are homogeneous and the rewards are purely rank…

Optimization and Control · Mathematics 2018-11-02 Erhan Bayraktar , Jakša Cvitanić , Yuchong Zhang

The Team-maxmin equilibrium prescribes the optimal strategies for a team of rational players sharing the same goal and without the capability of correlating their strategies in strategic games against an adversary. This solution concept can…

Artificial Intelligence · Computer Science 2016-11-21 Nicola Basilico , Andrea Celli , Giuseppe De Nittis , Nicola Gatti

We consider a game in which the action set of each player is uncountable, and show that, from weak assumptions on the common prior, any mixed strategy has an approximately equivalent pure strategy. The assumption of this result can be…

Theoretical Economics · Economics 2023-02-15 Yuhki Hosoya , Chaowen Yu

We introduce the class of pay or play games, which captures scenarios in which each decision maker is faced with a choice between two actions: one with a fixed payoff and an- other with a payoff dependent on others' selected actions. This…

Computer Science and Game Theory · Computer Science 2013-09-27 Sigal Oren , Michael Schapira , Moshe Tennenholtz

We study a strategic experimentation game with exponential bandits, in which experiment outcomes are private. The equilibrium amount of experimentation is always higher than in the benchmark case where experiment outcomes are publicly…

Computer Science and Game Theory · Computer Science 2025-12-09 Jérôme Renault , Eilon Solan , Nicolas Vieille

We consider a two-player dynamic information design problem between a principal and a receiver -- a game is played between the two agents on top of a Markovian system controlled by the receiver's actions, where the principal obtains and…

Computer Science and Game Theory · Computer Science 2024-03-20 Dengwang Tang , Vijay G. Subramanian

Experimental economics has repeatedly demonstrated that the Nash equilibrium makes inaccurate predictions for a vast set of games. Instead, several alternative theoretical concepts predict behavior that is much more in tune with observed…

General Finance · Quantitative Finance 2015-03-17 Christian Hilbe

Perfect Bayesian Equilibrium (PBE) is a refinement of the Nash equilibrium for imperfect-information extensive-form games (EFGs) that enforces consistency between the two components of a solution: agents' strategy profile describing their…

Computer Science and Game Theory · Computer Science 2026-02-23 Christine Konicki , Mithun Chakraborty , Michael P. Wellman

The overall aim of our research is to develop techniques to reason about the equilibrium properties of multi-agent systems. We model multi-agent systems as concurrent games, in which each player is a process that is assumed to act…

Logic in Computer Science · Computer Science 2020-08-14 Julian Gutierrez , Aniello Murano , Giuseppe Perelli , Sasha Rubin , Thomas Steeples , Michael Wooldridge

The timing of strategic exit is one of the most important but difficult business decisions, especially under competition and uncertainty. Motivated by this problem, we examine a stochastic game of exit in which players are uncertain about…

Optimization and Control · Mathematics 2023-10-09 H. Dharma Kwon , Jan Palczewski

Learning in games refers to scenarios where multiple players interact in a shared environment, each aiming to minimize their regret. An equilibrium can be computed at a fast rate of $O(1/T)$ when all players follow the optimistic…

Computer Science and Game Theory · Computer Science 2025-02-18 Taira Tsuchiya , Shinji Ito , Haipeng Luo

There are only limited classes of multi-player stochastic games in which independent learning is guaranteed to converge to a Nash equilibrium. Markov potential games are a key example of such classes. Prior work has outlined sets of…

Computer Science and Game Theory · Computer Science 2024-05-15 Fatemeh Fardno , Seyed Majid Zahedi

In decision-dependent games, multiple players optimize their decisions under a data distribution that shifts with their joint actions, creating complex dynamics in applications like market pricing. A practical consequence of these dynamics…

Computer Science and Game Theory · Computer Science 2025-09-04 Guangzheng Zhong , Yang Liu , Jiming Liu

A model of stochastic games where multiple controllers jointly control the evolution of the state of a dynamic system but have access to different information about the state and action processes is considered. The asymmetry of information…

Computer Science and Game Theory · Computer Science 2012-09-18 Ashutosh Nayyar , Abhishek Gupta , Cédric Langbort , Tamer Başar

We present a new model of incomplete information games without private information in which the players use a distributionally robust optimization approach to cope with the payoff uncertainty. With some specific restrictions, we show that…

Computer Science and Game Theory · Computer Science 2016-10-04 Nicolas Loizou

Many interactions result in a socially suboptimal equilibrium, or in a non-equilibrium state, from which arriving at an equilibrium through simple dynamics can be impossible of too long. Aiming to achieve a certain equilibrium, we persuade,…

Computer Science and Game Theory · Computer Science 2023-12-07 Gleb Polevoy , Jonas Schweichhart