How do we remember the past in randomised strategies?
@inproceedings{Cristau2010HowDW, title={How do we remember the past in randomised strategies?}, author={Julien Cristau and Claire David and Florian Horn}, booktitle={GANDALF}, year={2010} }
Graph games of infinite length are a natural model for open reactive processes: one player represents the controller, trying to ensure a given specification, and the other represents a hostile environment. The evolution of the system depends on the decisions of both players, supplemented by chance.
In this work, we focus on the notion of randomised strategy. More specifically, we show that three natural definitions may lead to very different results: in the most general cases, an almost-surely… Expand
5 Citations
Partial-Observation Stochastic Games: How to Win When Belief Fails
- Mathematics, Computer Science
- 2012 27th Annual IEEE Symposium on Logic in Computer Science
- 2012
- 8
- PDF
Qualitative Determinacy and Decidability of Stochastic Games with Signals
- Mathematics, Computer Science
- 2009 24th Annual IEEE Symposium on Logic In Computer Science
- 2009
- 47
- PDF
A survey of partial-observation stochastic parity games
- Computer Science
- Formal Methods Syst. Des.
- 2013
- 21
- PDF
Equilibres de Nash dans les jeux concurrents : application aux jeux temporisés. (Nash equilibria in concurrent games : application to timed games)
- Philosophy, Computer Science
- 2012
- 10
- PDF
References
SHOWING 1-10 OF 36 REFERENCES
How much memory is needed to win infinite games?
- Computer Science
- Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science
- 1997
- 128
- PDF
Concurrent reachability games
- Computer Science
- Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
- 1998
- 67
- PDF
Qualitative Determinacy and Decidability of Stochastic Games with Signals
- Mathematics, Computer Science
- 2009 24th Annual IEEE Symposium on Logic In Computer Science
- 2009
- 47
- PDF