A Globally Convergent Algorithm to Compute All Nash Equilibria for n -Person Games

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.137, Iss.1, 2005-07, pp. : 349-368

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

Algorithms for computing Nash equilibria in deterministic LQ games

By Engwerda Jacob

Computational Management Science, Vol. 4, Iss. 2, 2007-04 ,pp. : 113-140

Springer Publishing Company

Access to resources Recommend Favorite

An Approach for Reducing the Graphical Model and Genetic Algorithm for Computing Approximate Nash Equilibrium in Static Games

By Liu Wei-Yi Yue Kun Li Jin Song Ning Ding Li

Journal of Intelligent and Robotic Systems, Vol. 60, Iss. 2, 2010-11 ,pp. : 241-261

Springer Publishing Company

Access to resources Recommend Favorite

On the Existence of Maximum Likelihood Nash Equilibria

By Balder E.J.

Annals of Operations Research, Vol. 114, Iss. 1-4, 2002-08 ,pp. : 57-70

Springer Publishing Company

Access to resources Recommend Favorite

On Equilibria for ADM Minimization Games

By Epstein Leah Levin Asaf

Algorithmica, Vol. 63, Iss. 1-2, 2012-06 ,pp. : 246-273

Springer Publishing Company

Access to resources Recommend Favorite

On the Performance of Approximate Equilibria in Congestion Games

By Christodoulou George Koutsoupias Elias Spirakis Paul

Algorithmica, Vol. 61, Iss. 1, 2011-09 ,pp. : 116-140

Springer Publishing Company

Access to resources Recommend Favorite