✦ LIBER ✦

The Complexity of Computing a Nash Equilibrium

✍ Scribed by Daskalakis, Constantinos; Goldberg, Paul W.; Papadimitriou, Christos H.

Book ID: 118180897
Publisher: Society for Industrial and Applied Mathematics
Year: 2009
Tongue: English
Weight: 660 KB
Volume: 39
Category: Article
ISSN: 0097-5397
DOI: 10.1137/070699652

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Adjustment process-based approach for co

Adjustment process-based approach for computing a Nash-Cournot equilibrium

✍ Joanna M. Leleno 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 785 KB

Nash equilibrium when players account fo

Nash equilibrium when players account for the complexity of their forecasts

✍ Kfir Eliaz 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 255 KB

On the Convergence to Nash Equilibrium i

On the Convergence to Nash Equilibrium in Problems of Distributed Computing

✍ T. Boulogne; E. Altman; O. Pourtallier 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 114 KB

Computation of nash equilibrium pairs of

Computation of nash equilibrium pairs of a stochastic differential game

✍ Y. Yavin; G. Reuter 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 619 KB

Computability and randomness of Nash equ

Computability and randomness of Nash equilibrium in infinite games

✍ Kislaya Prasad 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 842 KB

Learning the optimum as a Nash equilibri

Learning the optimum as a Nash equilibrium

✍ Süheyla Özyıldırım; Nedim M. Alemdar 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 232 KB

This paper shows the computational bene"ts of a game theoretic approach to optimization of high dimensional control problems. A dynamic noncooperative game framework is adopted to partition the control space and to search the optimum as the equilibrium of a k-person dynamic game played by k-parallel