192 search results - page 4 / 39 » Complexity Bounds for Regular Games |
FOSSACS
2010
Springer
13 years 9 months ago
2010
Springer
We study variants of regular infinite games where the strict alternation of moves between the two players is subject to modifications. The second player may postpone a move for a f...
ICML
2004
IEEE
14 years 7 months ago
2004
IEEE
A fast-growing body of research in the AI and machine learning communities addresses learning in games, where there are multiple learners with different interests. This research a...
MFCS
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
MFCS
2004
Springer
13 years 11 months ago
2004
Springer
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
FORMATS
2008
Springer
13 years 7 months ago
2008
Springer
We consider two-player games played in real time on game structures with clocks and parity objectives. The games are concurrent in that at each turn, both players independently pro...