The determinacy of infinite games with eventual perfect monitoring

@inproceedings{Shmaya2009TheDO,
  title={The determinacy of infinite games with eventual perfect monitoring},
  author={Eran Shmaya},
  year={2009}
}
An infinite two-player zero-sum game with a Borel winning set, in which the opponent’s actions are monitored eventually but not necessarily immediately after they are played, admits a value. The proof relies on a representation of the game as a stochastic game with perfect information, in which Nature operates as a delegate for the players and performs the randomizations for them. 
Determinacy of Games with Stochastic Eventual Perfect Monitoring
We consider an infinite two-player stochastic zero-sum game with a Borel winning set, in which the opponent's actions are monitored via stochastic private signals. We identify two conditions of the
Stochastic games with information lag
  • Y. Levy
  • Economics
    Games Econ. Behav.
  • 2012
Stochastic Methods in Game Theory
2.1 Counterexamples : a simple compact continuous game with no limit value, a hidden stochastic game with no limit value 2.2. 1-player games (Dynamic programming, Gambling Houses and MDP): general
Zero-Sum Stochastic Games
In this article we describe a major part of the theory of zero-sum discrete-time stochastic games. We overview all basic streams of research in this area, in the context of the existence of value and
Games with Delays - A Frankenstein Approach
TLDR
This work proposes a model where signals are detached from control states, and identifies a subclass on which equilibrium outcomes can be preserved, even if signals are delivered with a delay that is finitely bounded.
Regularity of the minmax value and equilibria in multiplayer Blackwell games
A real-valued function φ that is defined over all Borel sets of a topological space is regular if for every Borel set W, φ(W) is the supremum of φ(C), over all closed sets C that are contained in W,
Advances in Zero-Sum Dynamic Games
Approachability with delayed information
No regret with delayed information ∗
TLDR
Deterministic and stochastic delayed information structures under which the decision maker has regret-free strategies are introduced and it is shown how the convergence rate to no-regret is sensitive to changes in the information structure.
...
...

References

SHOWING 1-10 OF 22 REFERENCES
The MaxMin value of stochastic games with imperfect monitoring
TLDR
It is proved that the uniform max-min value always exists and is independent of the information structure of player 2, and Symmetric results hold for the uniform min-max value.
A First Course on Zero Sum Repeated Games
Introduction and Examples.- Games with Incomplete Information.- Repeated Games with Lack of Information on One Side.- Repeated Games with Lack of Information on Both Sides.- Stochastic Games.-
Blackwell Games
Blackwell games are infinite games of imperfect information. The two players simultaneously make their moves and are then informed of each other’s moves. Payoff is determined by a Borel measurable
Finitely additive stochastic games with Borel measurable payoffs
Abstract. We prove that a two-person, zero-sum stochastic game with arbitrary state and action spaces, a finitely additive law of motion and a bounded Borel measurable payoff has a value.
Operator Solution of Infinite Gδ Games of Imperfect Information
GAMES WITH PARTIAL INFORMATION
Abstract : Consideration is given to a particular class of games with partial information. Generalized subgames are defined. These subgames give rise to functional equations whose solution permits a
Approximation Theorems for Gambling Problems and Stochastic Games
A two-person, zero-sum stochastic game with a countable state space X and finite action sets is known to have a value V(C)(V(O» if the payoff function is the indicator of a closed subset C (open
Theory of Games and Economic Behavior
THIS book is based on the theory that the economic man attempts to maximize his share of the world's goods and services in the same way that a participant in a game involving many players attempts to
Many inspections are manipulable
A self-proclaimed expert uses past observations of a stochastic process to make probabilistic predictions about the process. An inspector applies a test function to the infinite sequence of
A nonmanipulable test
TLDR
This work constructs a test that controls for type I error and is nonmanipulable, which has essentially no capacity to reject a strategic expert.
...
...