Random payoff games with partial information : one person games against nature
The search session has expired. Please query the service again.
Page 1
Displaying 1 – 6 of 6
Rationality of the information exchange in bimatrix games
Milan Mareš (1985)
Kybernetika
Realization of the Chess Mate Solver Application
Vladan V. Vučković (2004)
The Yugoslav Journal of Operations Research
Recursive algorithm for parity games requires exponential time
Oliver Friedmann (2011)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
This paper presents a new lower bound for the recursive algorithm for solving parity games which is induced by the constructive proof of memoryless determinacy by Zielonka. We outline a family of games of linear size on which the algorithm requires exponential time.
Recursive algorithm for parity games requires exponential time
Oliver Friedmann (2012)
RAIRO - Theoretical Informatics and Applications
This paper presents a new lower bound for the recursive algorithm for solving parity games which is induced by the constructive proof of memoryless determinacy by Zielonka. We outline a family of games of linear size on which the algorithm requires exponential time.
Remarks on a game of Choquet
Rastislav Telgársky (1987)
Colloquium Mathematicae
Currently displaying 1 – 6 of 6
Page 1