Memoryless determinacy of parity and mean payoff games: a simple proof

Author： Bjorklund H. Sandberg S. Vorobyov S.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.310, Iss.1, 2004-01, pp. : 365-378

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The complexity of mean payoff games on graphs

By Zwick U. Paterson M.

Theoretical Computer Science, Vol. 158, Iss. 1, 1996-05 ,pp. : 343-359

Elsevier

Access to resources Recommend Favorite

Learning payoff functions in infinite games

By Vorobeychik Yevgeniy

Machine Learning, Vol. 67, Iss. 1-2, 2007-05 ,pp. : 145-168

Springer Publishing Company

Access to resources Recommend Favorite

Prioritisation of weighted strategies in multiplayer games with fuzzy entries of the payoff matrix

By Rakus-Andersson Elisabeth

International Journal of General Systems, Vol. 39, Iss. 3, 2010-04 ,pp. : 291-304

Taylor & Francis Ltd

Access to resources Recommend Favorite

A survey of partial-observation stochastic parity games

By Chatterjee Krishnendu Doyen Laurent Henzinger Thomas

Formal Methods in System Design, Vol. 43, Iss. 2, 2013-10 ,pp. : 268-284

Springer Publishing Company

Access to resources Recommend Favorite

Optimization complexity of linear logic proof games

By Lincoln P.D. Mitchell J.C. Scedrov A.

Theoretical Computer Science, Vol. 227, Iss. 1, 1999-09 ,pp. : 299-331

Elsevier

Access to resources Recommend Favorite