2 papers
cs.GT2018
Banach-Mazur Parity Games and Almost-sure Winning Strategies
Youssouf Oualhadj, Léo Tible, Daniele Varacca
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 en…
cs.CC2012
Computational Complexity of Interactive Behaviors
Ugo Dal Lago, Tobias Heindel, Damiano Mazza +1
The theory of computational complexity focuses on functions and, hence, studies programs whose interactive behavior is reduced to a simple question/answer pattern. We propose a bro…