Game Development Reference
In-Depth Information
M. Jurdzinski and R. Savani. A simple P-matrix linear complementarity problem for
discounted games. In Computability in Europe (CiE) , volume 5028 of LNCS ,
pages 283-293. Springer, 2008.
M. Jurdzinski, M. Paterson, and U. Zwick. A deterministic subexponential algorithm
for solving parity games. SIAM J. Comput. , 38(4):1519-1532, 2008.
C. E. Lemke. Bimatrix equilibrium points and mathematical programming. Man-
agement Science , 11:681-689, 1965.
W. Ludwig. A subexponential randomized algorithm for the simple stochastic game
problem. Inf. Comput. , 117(1):151-155, 1995.
D. A. Martin. The determinacy of Blackwell games. J. Symb. Log. , 63(4):1565-1581,
1998.
J. Matousek, M. Sharir, and E. Welzl. A subexponential bound for linear program-
ming. Algorithmica , 16:498-516, 1996.
R. McNaughton. Infinite games played on finite graphs. Ann. Pure Appl. Logic ,65
(2):149-184, 1993.
C. H. Papadimitriou. On the complexity of the parity argument and other ine cient
proofs of existence. J. Comput. Syst. Sci. , 48:498-532, 1994.
A. Puri. Theory of Hybrid Systems and Discrete Event Systems .
PhD thesis,
University of California, Berkeley, 1995.
M. L. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Pro-
gramming . Wiley Blackwell, 2005.
S. Schewe. Solving parity games in big steps. In FSTTCS 2007 , volume 4855 of
Lecture Notes in Computer Science , pages 449-460. Springer, 2007.
H. Seidl. Fast and simple nested fixpoints. Inf. Process. Lett. , 59(6):303-308, 1996.
C. Stirling. Local model checking games (Extended abstract). In Concurrency
Theory (CONCUR) , volume 962 of Lecture Notes in Computer Science , pages
1-11. Springer, 1995.
J. Voge and M. Jurdzinski. A discrete strategy improvement algorithm for solving
parity games (Extended abstract). In Computer Aided Verification (CAV) ,
volume 1855 of Lecture Notes in Computer Science , pages 202-215. Springer,
2000.
W. Zielonka. Infinite games on finitely coloured graphs with applications to automata
on infinite trees. Theor. Comput. Sci. , 200(1-2):135-183, 1998.
Search Nedrilad ::




Custom Search