✦ LIBER ✦

Computing Nash Equilibria for Scheduling on

✍ Scribed by Martin Gairing; Thomas Lücking; Marios Mavronicolas; Burkhard Monien

Book ID: 105915085
Publisher: Springer
Year: 2009
Tongue: English
Weight: 639 KB
Volume: 47
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-009-9191-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the computability of Nash equilibria

✍ Kislaya Prasad 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 763 KB

We present some algorithmic unsolvability and incompleteness results in game theory and discuss their significance. The main theorem presents a class of n-person games, where each player's strategy set is the real line and payoffs are continuous functions, for which there could not possibly exist a

Algorithms for computing Nash equilibria

Algorithms for computing Nash equilibria in deterministic LQ games

✍ Jacob Engwerda 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 356 KB

Computing Nash equilibria by iterated po

Computing Nash equilibria by iterated polymatrix approximation

✍ Srihari Govindan; Robert Wilson 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 249 KB

This article develops a new algorithm for computing Nash equilibria of N -player games. The algorithm approximates a game by a sequence of polymatrix games in which the players interact bilaterally. We provide su cient conditions for local convergence to an equilibrium and report computational exper

Computing generalized Nash equilibria by

Computing generalized Nash equilibria by polynomial programming

✍ Couzoudis, Eleftherios; Renner, Philipp 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 201 KB

Computing approximate Nash equilibria in

Computing approximate Nash equilibria in network congestion games

✍ Andreas Emil Feldmann; Heiko Röglin; Berthold Vöcking 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB

On Non-Nash Equilibria

✍ Mario Gilli 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 415 KB