Approximation and characterization of Nash equilibria of large games
Sign Up to like & getrecommendations! Published in 2020 at "Economic Theory"
DOI: 10.1007/s00199-020-01314-9
Abstract: We characterize Nash equilibria of games with a continuum of players in terms of approximate equilibria of large finite games. This characterization precisely describes the relationship between the equilibrium sets of the two classes of… read more here.
Keywords: large games; characterization nash; nash equilibria; continuum players ... See more keywords
Logarithmic Query Complexity for Approximate Nash Computation in Large Games
Sign Up to like & getrecommendations! Published in 2018 at "Theory of Computing Systems"
DOI: 10.1007/s00224-018-9851-8
Abstract: We investigate the problem of equilibrium computation for “large” n-player games. Large games have a Lipschitz-type property that no single player’s utility is greatly affected by any other individual player’s actions. In this paper, we… read more here.
Keywords: large games; logarithmic query; player; query complexity ... See more keywords