On the Complexity of Iterated Weak Dominance in Constant-Sum Games

Author： Brandt Felix  

Publisher： Springer Publishing Company

ISSN： 1432-4350

Source： Theory of Computing Systems, Vol.49, Iss.1, 2011-07, pp. : 162-181

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 Computational Complexity of Weak Saddles

By Brandt Felix  

Theory of Computing Systems, Vol. 49, Iss. 1, 2011-07 ,pp. : 139-161

Springer Publishing Company

Access to resources Recommend Favorite

Zero-sum and nonzero-sum differential games without Isaacs condition∗

By Li Juan   Li Wenqiang  

ESAIM: Control, Optimisation and Calculus of Variations, Vol. 23, Iss. 3, 2017-05 ,pp. : 1217-1252

Edp Sciences

Access to resources Recommend Favorite

Stochastic dominance equilibria in two-person noncooperative games

By Perea Andres   Peters Hans   Schulteis Tim   Vermeulen Dries  

International Journal of Game Theory, Vol. 34, Iss. 4, 2006-11 ,pp. : 457-473

Springer Publishing Company

Access to resources Recommend Favorite

On the complexity of the theories of weak direct powers

By  

The Journal of Symbolic Logic, Vol. 41, Iss. 3, 1976-09 ,pp. : 561-573

Cambridge University Press

Access to resources Recommend Favorite

The Price of Anarchy in Network Creation Games Is (Mostly) Constant

By Mihalák Matúš  

Theory of Computing Systems, Vol. 53, Iss. 1, 2013-07 ,pp. : 53-72

Springer Publishing Company

Access to resources Recommend Favorite