English
Related papers

Related papers: The value of Repeated Games with an informed contr…

200 papers

Zero-determinant strategies are memory-one strategies in repeated games which unilaterally enforce linear relations between expected payoffs of players. Recently, the concept of zero-determinant strategies was extended to the class of…

Optimization and Control · Mathematics 2022-09-07 Masahiko Ueda

We study new classes of games, called zero-sum equivalent games and zero-sum equivalent potential games, and prove decomposition theorems involving these classes of games. We say that two games are "strategically equivalent" if, for every…

Computer Science and Game Theory · Computer Science 2020-05-20 Sung-Ha Hwang , Luc Rey-Bellet

The paper proposes a natural measure space of zero-sum perfect information games with upper semicontinuous payoffs. Each game is specified by the game tree, and by the assignment of the active player and of the capacity to each node of the…

Computer Science and Game Theory · Computer Science 2021-04-22 János Flesch , Arkadi Predtetchinski , Ville Suomala

Mean-payoff games are important quantitative models for open reactive systems. They have been widely studied as games of full observation. In this paper we investigate the algorithmic properties of several sub-classes of mean-payoff games…

Computer Science and Game Theory · Computer Science 2017-10-10 Paul Hunter , Arno Pauly , Guillermo A. Pérez , Jean-François Raskin

Two-player quantitative zero-sum games provide a natural framework to synthesize controllers with performance guarantees for reactive systems within an uncontrollable environment. Classical settings include mean-payoff games, where the…

Logic in Computer Science · Computer Science 2015-09-25 Patricia Bouyer , Nicolas Markey , Mickael Randour , Kim G. Larsen , Simon Laursen

Priced timed games are two-player zero-sum games played on priced timed automata (whose locations and transitions are labeled by weights modelling the cost of spending time in a state and executing an action, respectively). The goals of the…

Computer Science and Game Theory · Computer Science 2023-06-22 Thomas Brihaye , Gilles Geeraerts , Axel Haddad , Engel Lefaucheux , Benjamin Monmege

A valuation for a player in a game in extensive form is an assignment of numeric values to the players moves. The valuation reflects the desirability moves. We assume a myopic player, who chooses a move with the highest valuation.…

Machine Learning · Computer Science 2007-05-23 Philippe Jehiel , Dov Samet

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

This paper considers a zero-sum two-player asymmetric information stochastic game where only one player knows the system state, and the transition law is controlled by the informed player only. For the informed player, it has been shown…

Computer Science and Game Theory · Computer Science 2017-11-08 Lichun Li , Cedric Langbort , Jeff S. Shamma

We study continuity properties of stochastic game problems with respect to various topologies on information structures, defined as probability measures characterizing a game. We will establish continuity properties of the value function…

Optimization and Control · Mathematics 2022-11-02 Ian Hogeboom-Burr , Serdar Yüksel

Using methods from the statistical mechanics of disordered systems we analyze the properties of bimatrix games with random payoffs in the limit where the number of pure strategies of each player tends to infinity. We analytically calculate…

Disordered Systems and Neural Networks · Physics 2009-10-31 Johannes Berg

This paper formally models the strategic repeated interactions between a system, comprising of a machine learning (ML) model and associated explanation method, and an end-user who is seeking a prediction/label and its explanation for a…

Computer Science and Game Theory · Computer Science 2022-08-24 Kavita Kumari , Murtuza Jadliwala , Sumit Kumar Jha , Anindya Maiti

We consider an n-player symmetric stochastic game with weak interaction between the players. Time is continuous and the horizon and the number of states are finite. We show that the value function of each of the players can be approximated…

Analysis of PDEs · Mathematics 2018-07-13 Erhan Bayraktar , Asaf Cohen

In this note, we consider repeated play of a finite game using learning rules whose period-by-period behavior probabilities or empirical distributions converge to some notion of equilibria of the stage game. Our primary focus is on…

Computer Science and Game Theory · Computer Science 2013-10-22 M. Sadegh Talebi

We study a repeated game with payoff externalities and observable actions where two players receive information over time about an underlying payoff-relevant state, and strategically coordinate their actions. Players learn about the true…

Theoretical Economics · Economics 2018-09-05 Pathikrit Basu , Kalyan Chatterjee , Tetsuya Hoshino , Omer Tamuz

We study a two-player, zero-sum, dynamic game with incomplete information where one of the players is more informed than his opponent. We analyze the limit value as the players play more and more frequently. The more informed player…

Optimization and Control · Mathematics 2015-09-14 Fabien Gensbittel

We provide several tests to determine whether a game is a potential game or whether it is a zero-sum equivalent game---a game which is strategically equivalent to a zero-sum game in the same way that a potential game is strategically…

Computer Science and Game Theory · Computer Science 2020-02-25 Sung-Ha Hwang , Luc Rey-Bellet

We study a zero-sum stochastic differential game (SDG) in which one controller plays an impulse control while their opponent plays a stochastic control. We consider an asymmetric setting in which the impulse player commits to, at the start…

Probability · Mathematics 2019-01-31 Parsiad Azimzadeh

We prove that zero-sum Dynkin games in continuous time with partial and asymmetric information admit a value in randomised stopping times when the stopping payoffs of the players are general \cadlag measurable processes. As a by-product of…

Probability · Mathematics 2022-06-08 Tiziano De Angelis , Nikita Merkulov , Jan Palczewski

This work considers two-player zero-sum semi-Markov games with incomplete information on one side and perfect observation. At the beginning, the system selects a game type according to a given probability distribution and informs to Player…

Optimization and Control · Mathematics 2021-07-16 Fang Chen , Xianping Guo , Zhong-Wei Liao