English
Related papers

Related papers: Well-Founded Extensive Games with Perfect Informat…

200 papers

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

We examine the problem of the existence of optimal deterministic stationary strategiesintwo-players antagonistic (zero-sum) perfect information stochastic games with finitely many states and actions.We show that the existenceof such…

Computer Science and Game Theory · Computer Science 2016-11-28 Hugo Gimbert , Wieslaw Zielonka

Stochastic games are an important class of problems that generalize Markov decision processes to game theoretic scenarios. We consider finite state two-player zero-sum stochastic games over an infinite time horizon with discounted rewards.…

Optimization and Control · Mathematics 2008-06-17 Parikshit Shah , Pablo A. Parrilo

In the literature on game-theoretic equilibrium finding, focus has mainly been on solving a single game in isolation. In practice, however, strategic interactions -- ranging from routing problems to online advertising auctions -- evolve…

Computer Science and Game Theory · Computer Science 2023-03-02 Keegan Harris , Ioannis Anagnostides , Gabriele Farina , Mikhail Khodak , Zhiwei Steven Wu , Tuomas Sandholm

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

Game theory provides a mathematical framework for analysing strategic situations involving at least two players. Normal-form games model situations where the players simultaneously pick their moves. In this thesis we explore the strategic…

Combinatorics · Mathematics 2019-05-03 Nicholas Ham

The classical, complete-information two-player games assume that the problem data (in particular the payoff matrix) is known exactly by both players. In a now famous result, Nash has shown that any such game has an equilibrium in mixed…

Computer Science and Game Theory · Computer Science 2015-12-11 Nicolas Loizou

We provide, to the best of our knowledge, the first computational study of extensive-form adversarial team games. These games are sequential, zero-sum games in which a team of players, sharing the same utility function, faces an adversary.…

Artificial Intelligence · Computer Science 2017-11-21 Andrea Celli , Nicola Gatti

We show open games cover extensive form games with both perfect and imperfect information. Doing so forces us to address two current weaknesses in open games: the lack of a notion of player and their agency within open games, and the lack…

Computer Science and Game Theory · Computer Science 2022-11-04 Matteo Capucci , Neil Ghani , Jérémy Ledent , Fredrik Nordvall Forsberg

Evidence games study situations where a sender persuades a receiver by selectively disclosing hard evidence about an unknown state of the world. Evidence games often have multiple equilibria. Hart et al. (2017) propose to focus on…

Theoretical Economics · Economics 2022-09-20 Shaofei Jiang

We study the problem of characterizing the set of games that are consistent with observed equilibrium play. Our contribution is to develop and analyze a new methodology based on convex optimization to address this problem for many classes…

Computer Science and Game Theory · Computer Science 2017-03-23 Juba Ziani , Venkat Chandrasekaran , Katrina Ligett

We study the problem of finding equilibrium strategies in multi-agent games with incomplete payoff information, where the payoff matrices are only known to the players up to some bounded uncertainty sets. In such games, an ex-post…

Computer Science and Game Theory · Computer Science 2020-07-14 Wenshuo Guo , Mihaela Curmei , Serena Wang , Benjamin Recht , Michael I. Jordan

In their seminal work, Nayyar et al. (2013) showed that imperfect information can be abstracted away from common-payoff games by having players publicly announce their policies as they play. This insight underpins sound solvers and…

Computer Science and Game Theory · Computer Science 2023-08-02 Samuel Sokota , Ryan D'Orazio , Chun Kai Ling , David J. Wu , J. Zico Kolter , Noam Brown

We exhibit the rich structure of the set of correlated equilibria by analyzing the simplest of polynomial games: the mixed extension of matching pennies. We show that while the correlated equilibrium set is convex and compact, the structure…

Computer Science and Game Theory · Computer Science 2011-12-08 Noah D. Stein , Asuman Ozdaglar , Pablo A. Parrilo

Poker is in the family of imperfect information games unlike other games such as chess, connect four, etc which are perfect information game instead. While many perfect information games have been solved, no non-trivial imperfect…

Computer Science and Game Theory · Computer Science 2024-01-15 Prathamesh Sonawane , Arav Chheda

In this paper we study continuous-time two-player zero-sum optimal switching games on a finite horizon. Using the theory of doubly reflected BSDEs with interconnected barriers, we show that this game has a value and an equilibrium in the…

Optimization and Control · Mathematics 2018-06-04 Said Hamadène , Randall Martyr , John Moriarty

We show that under some general conditions the finite memory determinacy of a class of two-player win/lose games played on finite graphs implies the existence of a Nash equilibrium built from finite memory strategies for the corresponding…

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

We investigate two notions of correlated equilibrium for extensive-form games: extensive-form correlated equilibrium (EFCE) and behavioral correlated equilibrium (BCE). We show that the two are outcome-equivalent, in the sense that every…

Computer Science and Game Theory · Computer Science 2024-02-09 Brian Hu Zhang , Tuomas Sandholm

We study the value and the optimal strategies for a two-player zero-sum optimal stopping game with incomplete and asymmetric information. In our Bayesian set-up, the drift of the underlying diffusion process is unknown to one player…

Probability · Mathematics 2020-07-15 Tiziano De Angelis , Erik Ekström , Kristoffer Glover

The known results regarding two-player zero-sum games are naturally generalized in complex space and are presented through a complete compact theory. The payoff function is defined by the real part of the payoff function in the real case,…

Optimization and Control · Mathematics 2022-11-30 Nick Dimou