English
Related papers

Related papers: Sequential Cursed Equilibrium

200 papers

We consider a dynamical approach to game in extensive forms. By restricting the convertibility relation over strategy profiles, we obtain a semi-potential (in the sense of Kukushkin), and we show that in finite games the corresponding…

Computer Science and Game Theory · Computer Science 2017-04-05 Stéphane Le Roux , Arno Pauly

We consider extensive games with perfect information with well-founded game trees and study the problems of existence and of characterization of the sets of subgame perfect equilibria in these games. We also provide such characterizations…

Computer Science and Game Theory · Computer Science 2021-06-23 Krzysztof R. Apt , Sunil Simon

In this note, we prove the existence of an equilibrium concept, dubbed conditional strategy equilibrium, for non-cooperative games in which a strategy of a player is a function from the other players' actions to her own actions. We study…

Theoretical Economics · Economics 2022-05-09 Lorenzo Bastianello , Mehmet S. Ismail

The Stackelberg equilibrium solution concept describes optimal strategies to commit to: Player 1 (termed the leader) publicly commits to a strategy and Player 2 (termed the follower) plays a best response to this strategy (ties are broken…

Computer Science and Game Theory · Computer Science 2016-08-24 Branislav Bosansky , Simina Branzei , Kristoffer Arnsfelt Hansen , Peter Bro Miltersen , Troels Bjerre Sorensen

Nash equilibrium is the most commonly-used notion of equilibrium in game theory. However, it suffers from numerous problems. Some are well known in the game theory community; for example, the Nash equilibrium of repeated prisoner's dilemma…

Computer Science and Game Theory · Computer Science 2008-12-18 Joseph Y. Halpern

While Nash equilibrium has emerged as the central game-theoretic solution concept, many important games contain several Nash equilibria and we must determine how to select between them in order to create real strategic agents. Several Nash…

Computer Science and Game Theory · Computer Science 2024-04-30 Sam Ganzfried

We extend the classic regret minimization framework for approximating equilibria in normal-form games by greedily weighing iterates based on regrets observed at runtime. Theoretically, our method retains all previous convergence rate…

Computer Science and Game Theory · Computer Science 2022-04-12 Hugh Zhang , Adam Lerer , Noam Brown

Through a stochastic control theoretic approach, we analyze reputation games where a strategic long-lived player acts in a sequential repeated game against a collection of short-lived players. The key assumption in our model is that the…

Optimization and Control · Mathematics 2020-01-22 Nuh Aygün Dalkıran , Serdar Yüksel

This paper proposes a new equilibrium concept "robust perfect equilibrium" for non-cooperative games with a continuum of players, incorporating three types of perturbations. Such an equilibrium is shown to exist (in symmetric mixed…

Theoretical Economics · Economics 2021-05-06 Enxian Chen , Lei Qiao , Xiang Sun , Yeneng Sun

In experimental applications of bounded-reasoning models, behavior is often summarized by distributions of "levels". We argue that such summaries conflate two conceptually distinct dimensions: a player's type, capturing beliefs about what…

Theoretical Economics · Economics 2026-04-15 Shuige Liu , Gabriel Ziegler

A Bayesian game is said to have nested information if the players are ordered, and each player knows the types of all players that follow her in that order. We prove that all multiplayer Bayesian games with finite actions spaces, bounded…

Probability · Mathematics 2025-02-24 Royi Jacobovic , John Yehuda Levy , Eilon Solan

Recent advancements in algorithms for sequential decision-making under imperfect information have shown remarkable success in large games such as limit- and no-limit poker. These algorithms traditionally formalize the games using the…

Computer Science and Game Theory · Computer Science 2023-12-07 Vojtěch Kovařík , David Milec , Michal Šustr , Dominik Seitz , Viliam Lisý

A central task of artificial intelligence is the design of artificial agents that act towards specified goals in partially observed environments. Since such environments frequently include interaction over time with other agents with their…

Computer Science and Game Theory · Computer Science 2012-05-14 Miroslav Dudik , Geoffrey Gordon

We study a discrete-time finite-horizon two-players nonzero-sum stopping game where the filtration of Player 1 is richer than the filtration of Player 2. A major difficulty which is caused by the information asymmetry is that Player 2 may…

Optimization and Control · Mathematics 2022-09-29 Royi Jacobovic

We investigate Kantian equilibria in finite normal form games, a class of non-Nashian, morally motivated courses of action that was recently proposed in the economics literature. We highlight a number of problems with such equilibria,…

Computer Science and Game Theory · Computer Science 2021-06-23 Gabriel Istrate

This paper introduces constrained correlated equilibrium, a solution concept combining correlation and coupled constraints in finite non-cooperative games. In the general case of an arbitrary correlation device and coupled constraints in…

Computer Science and Game Theory · Computer Science 2023-09-13 Omar Boufous , Rachid El-Azouzi , Mikaël Touati , Eitan Altman , Mustapha Bouhtou

We consider 2-player stochastic games with perfectly observed actions, and study the limit, as the discount factor goes to one, of the equilibrium payoffs set. In the usual setup where current states are observed by the players, we show…

Optimization and Control · Mathematics 2014-12-11 Jérôme Renault , Bruno Ziliotto

We investigate Kantian equilibria in finite normal form games, a class of non-Nashian, morally motivated courses of action that was recently proposed in the economics literature. We highlight a number of problems with such equilibria,…

Computer Science and Game Theory · Computer Science 2021-04-22 Gabriel Istrate

We investigate an alternative concept of Nash equilibrium, m-equilibrium, which slightly resembles Harsanyi-Selten risk dominant equilibrium although it is a different notion. M-equilibria provide nontrivial solutions of normal form games…

Computer Science and Game Theory · Computer Science 2013-06-27 Krzysztof Leśniak

Computational aspects of solution notions such as Nash equilibrium have been extensively studied, including settings where the ultimate goal is to find an equilibrium that possesses some additional properties. Furthermore, in order to…

Computational Complexity · Computer Science 2023-05-09 Bruce M. Kapron , Koosha Samieefar