thesis
Bounded rationality in concurrent parity games
IST Austria Technical Report
published
Krishnendu
Chatterjee
author 2E5DCA20-F248-11E8-B48F-1D18A9856A870000-0002-4561-241X
KrCh
department
We consider 2-player games played on a finite state space for an infinite number of rounds. The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine the successor state. We study concurrent games with ω-regular winning conditions specified as parity objectives. We consider the qualitative analysis problems: the computation of the almost-sure and limit-sure winning set of states, where player 1 can ensure to win with probability 1 and with probability arbitrarily close to 1, respectively. In general the almost-sure and limit-sure winning strategies require both infinite-memory as well as infinite-precision (to describe probabilities). We study the bounded-rationality problem for qualitative analysis of concurrent parity games, where the strategy set for player 1 is restricted to bounded-resource strategies. In terms of precision, strategies can be deterministic, uniform, finite-precision or infinite-precision; and in terms of memory, strategies can be memoryless, finite-memory or infinite-memory. We present a precise and complete characterization of the qualitative winning sets for all combinations of classes of strategies. In particular, we show that uniform memoryless strategies are as powerful as finite-precision infinite-memory strategies, and infinite-precision memoryless strategies are as powerful as infinite-precision finite-memory strategies. We show that the winning sets can be computed in O(n2d+3) time, where n is the size of the game structure and 2d is the number of priorities (or colors), and our algorithms are symbolic. The membership problem of whether a state belongs to a winning set can be decided in NP ∩ coNP. While this complexity is the same as for the simpler class of turn-based parity games, where in each state only one of the two players has a choice of moves, our algorithms,that are obtained by characterization of the winning sets as μ-calculus formulas, are considerably more involved than those for turn-based games.
https://research-explorer.ista.ac.at/download/5380/5544/IST-2011-0008_IST-2011-0008.pdf
application/pdfno
IST Austria2011
eng
2664-169010.15479/AT:IST-2011-0008
53
https://research-explorer.ista.ac.at/record/3338
Chatterjee, K. (2011). <i>Bounded rationality in concurrent parity games</i>. IST Austria. <a href="https://doi.org/10.15479/AT:IST-2011-0008">https://doi.org/10.15479/AT:IST-2011-0008</a>
Chatterjee K. <i>Bounded Rationality in Concurrent Parity Games</i>. IST Austria; 2011. doi:<a href="https://doi.org/10.15479/AT:IST-2011-0008">10.15479/AT:IST-2011-0008</a>
Chatterjee K. 2011. Bounded rationality in concurrent parity games, IST Austria, 53p.
K. Chatterjee, Bounded Rationality in Concurrent Parity Games, IST Austria, 2011.
K. Chatterjee, <i>Bounded rationality in concurrent parity games</i>. IST Austria, 2011.
Chatterjee, Krishnendu. <i>Bounded Rationality in Concurrent Parity Games</i>. IST Austria, 2011. <a href="https://doi.org/10.15479/AT:IST-2011-0008">https://doi.org/10.15479/AT:IST-2011-0008</a>.
Chatterjee, Krishnendu. <i>Bounded Rationality in Concurrent Parity Games</i>. IST Austria, 2011, doi:<a href="https://doi.org/10.15479/AT:IST-2011-0008">10.15479/AT:IST-2011-0008</a>.
53802018-12-12T11:39:00Z2023-02-23T11:22:53Z