منابع مشابه
The Determinacy of Infinite Games with Eventual Perfect Monitoring
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 introduce two conditions of the signalling structure: Stochastic Eventual Perfect Monitoring (SEPM) and Weak Stochastic Eventual Perfect Monitoring (WSEPM). When signals are deterministic these two conditions coincide and by a rec...
متن کاملHalf-Positional Determinacy of Infinite Games
We study infinite games where one of the players always has a positional (memory-less) winning strategy, while the other player may use a historydependent strategy. We investigate winning conditions which guarantee such a property for all arenas, or all finite arenas. We establish some closure properties of such conditions, which give rise to the XPS class of winning conditions, and discover so...
متن کاملRepeated Games with Perfect Monitoring
We present a relatively general model of repeated games first, which will be later specialized for each different repeated game with different monitoring structure. Stage game is a standard strategic (normal) form game G = {N,A, g} , where N = {1, 2, ..., n} be the set of players, Ai is player i’s finite or compact action set ¡ A = Q i∈N Ai ¢ , and g : A→ <n is the payoff functions of n players...
متن کاملMemoryless Determinacy of Infinite Parity Games: Another Simple Proof
The memoryless determinacy of infinite parity games was proven independently by Emerson and Jutla [1], and Mostowski [4], with various applications in computer science. Then Zielonka [5] provided an elegant and simple argument. Several simpler proofs can be found in the literature in the case where the underlying graph is finite. These proofs usually proceed by induction on the number of releva...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2011
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-2011-10987-0