Author： Zwick U. Paterson M.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.158, Iss.1, 1996-05, pp. : 343-359
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Memoryless determinacy of parity and mean payoff games: a simple proof
By Bjorklund H. Sandberg S. Vorobyov S.
Theoretical Computer Science, Vol. 310, Iss. 1, 2004-01 ,pp. :
Access to resources
Recommend
Learning payoff functions in infinite games
Machine Learning, Vol. 67, Iss. 1-2, 2007-05 ,pp. :
The core of games on ordered structures and graphs
Annals of Operations Research, Vol. 204, Iss. 1, 2013-04 ,pp. :
Fugitive-search games on graphs and related parameters
By Dendris N.D. Kirousis L.M. Thilikos D.M.
Theoretical Computer Science, Vol. 172, Iss. 1, 1997-02 ,pp. :