Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Banach-Mazur Parity Games and Almost-sure Winning Strategies (1806.10025v1)

Published 26 Jun 2018 in cs.GT and cs.LO

Abstract: Two-player stochastic games are games with two 2 players and a randomised entity called "nature". A natural question to ask in this framework is the existence of strategies that ensure that an event happens with probability 1 (almost-sure strategies). In the case of Markov decision processes, when the event 2 of interest is given as a parity condition, we can replace the "nature" by two more players that play according to the rules of what is known as Banach-Mazur game [1]. In this paper we continue this research program by extending the above result to two-player stochastic parity games. As in the paper [1], the basic idea is that, under the correct hypothesis, we can replace the randomised player with two players playing a Banach-Mazur game. This requires a few technical observations, and a non trivial proof, that this paper sets out to do.

Summary

We haven't generated a summary for this paper yet.