Approximation Notions in Concave Games

Posted: 28 Oct 2019

See all articles by Emerson Melo

Emerson Melo

Indiana University Bloomington

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

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

Emerson Melo (Contact Author)

Indiana University Bloomington ( email )

Dept of Economics
100 South Indiana Ave.
Bloomington, IN 47405
United States

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Abstract Views
509
PlumX Metrics