On the communication complexity of approximate Nash equilibria
Year of publication: |
2014
|
---|---|
Authors: | Goldberg, Paul ; Pastink, Arnoud |
Published in: |
Games and economic behavior. - Amsterdam : Elsevier, ISSN 0899-8256, ZDB-ID 1002944-8. - Vol. 85.2014, p. 19-31
|
Subject: | Two player | Mixed strategy | Approximate equilibria | Efficient algorithms | Nash-Gleichgewicht | Nash equilibrium | Spieltheorie | Game theory | Algorithmus | Algorithm |
-
On the communication complexity of approximate Nash equilibria
Goldberg, Paul W., (2014)
-
Suzuki, Ken-ichi, (2018)
-
Technical note: characterizing and computing the set of nash equilibria via vector optimization
Feinstein, Zachary, (2024)
- More ...
-
On the communication complexity of approximate Nash equilibria
Goldberg, Paul W., (2014)
-
On the approximation performance of fictitious play in finite games
Goldberg, Paul, (2013)
-
Consistency in Soviet investment rules
Goldberg, Paul, (1988)
- More ...