Approximation Notions in Concave Games
Posted: 28 Oct 2019
Date Written: October 9, 2019
Abstract
This paper studies three different approximation concepts in the context of n-person concave games. Formally, we establish the precise relationship between the notions of ε-Nash Equilibrium, $\hatε-approximate solution, and δ-near Nash equilibrium. We apply our results to the class of Lipschitz games and discrete network games respectively.
Keywords: ε-Nash Equilibrium, $\hatε-approximate solution, δ-near Nash Equilibrium, VI, Lipschitz games, Network games.
JEL Classification: C72, C61, D85
Suggested Citation: Suggested Citation
Melo, Emerson, Approximation Notions in Concave Games (October 9, 2019). Available at SSRN: https://ssrn.com/abstract=3467056 or http://dx.doi.org/10.2139/ssrn.3467056
Feedback
Feedback to SSRN
If you need immediate assistance, call 877-SSRNHelp (877 777 6435) in the United States, or +1 212 448 2500 outside of the United States, 8:30AM to 6:00PM U.S. Eastern, Monday - Friday.