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 |
-
On the communication complexity of approximate Nash equilibria
Goldberg, Paul W., (2014)
-
A game with no Bayesian approximate equilibria
Hellman, Ziv, (2014)
-
Computing approximate equilibria in weighted congestion games via best-responses
Giannakopoulos, Yiannis, (2022)
- More ...
-
On the communication complexity of approximate Nash equilibria
Goldberg, Paul W., (2014)
-
A unified approach to congestion games and two-sided markets
Ackermann, Heiner, (2007)
-
Goldberg, Paul, (1985)
- More ...