Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Solving Pushdown Games with a Sigma3 Winning Condition
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
Games where you can play optimally without any memory
CONCUR 2005 - Concurrency Theory
On the positional determinacy of edge-labeled games
Theoretical Computer Science
Pure stationary optimal strategies in Markov decision processes
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Exploring the boundary of half positionality
CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
On memoryless quantitative objectives
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Measuring permissiveness in parity games: mean-payoff parity games revisited
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Quantitatively fair scheduling
Theoretical Computer Science
Exploring the boundary of half-positionality
Annals of Mathematics and Artificial Intelligence
Theoretical Computer Science
Omega-regular half-positional winning conditions
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Automated analysis of real-time scheduling using graph games
Proceedings of the 16th international conference on Hybrid systems: computation and control
| Hi-index | 0.00 |
We study infinite games where one of the players always has a positional (memory-less) winning strategy, while the other player may use a history-dependent 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, and discover some common reasons behind several known and new positional determinacy results. We exhibit several new classes of winning conditions having this property: the class of concave conditions (for finite arenas) and the classes of monotonic conditions and geometrical conditions (for all arenas)