DeepAI AI Chat
Log In Sign Up

Common Information Belief based Dynamic Programs for Stochastic Zero-sum Games with Competing Teams

by   Dhruva Kartik, et al.

Decentralized team problems where players have asymmetric information about the state of the underlying stochastic system have been actively studied, but games between such teams are less understood. We consider a general model of zero-sum stochastic games between two competing teams. This model subsumes many previously considered team and zero-sum game models. For this general model, we provide bounds on the upper (min-max) and lower (max-min) values of the game. Furthermore, if the upper and lower values of the game are identical (i.e., if the game has a value), our bounds coincide with the value of the game. Our bounds are obtained using two dynamic programs based on a sufficient statistic known as the common information belief (CIB). We also identify certain information structures in which only the minimizing team controls the evolution of the CIB. In these cases, we show that one of our CIB based dynamic programs can be used to find the min-max strategy (in addition to the min-max value). We propose an approximate dynamic programming approach for computing the values (and the strategy when applicable) and illustrate our results with the help of an example.


page 1

page 2

page 3

page 4


Zero-sum Stochastic Games with Asymmetric Information

A general model for zero-sum stochastic games with asymmetric informatio...

How to correctly prune tropical trees

We present tropical games, a generalization of combinatorial min-max gam...

Shannon meets von Neumann: A Minimax Theorem for Channel Coding in the Presence of a Jammer

We study the setting of channel coding over a family of channels whose s...

Making Change in 2048

The 2048 game involves tiles labeled with powers of two that can be merg...

Playing Games with Bounded Entropy: Convergence Rate and Approximate Equilibria

We consider zero-sum repeated games in which the players are restricted ...

Computing an Optimal Pitching Strategy in a Baseball At-Bat

The field of quantitative analytics has transformed the world of sports ...

Adaptive Relaxations for Multistage Robust Optimization

Multistage robust optimization problems can be interpreted as two-person...