Graph continuous function

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In mathematics, and in particular the study of game theory, a function is graph continuous if it exhibits the following properties. The concept was originally defined by Partha Dasgupta and Eric Maskin in 1986 and is a version of continuity that finds application in the study of continuous games.

Notation and preliminaries[edit]

Consider a game with N agents with agent i having strategy A_i\subseteq\Bbb{R}; write \mathbf{a} for an N-tuple of actions (i.e. \mathbf{a}\in\prod_{j=1}^NA_j) and \mathbf{a}_{-i}=(a_1,a_2,\ldots,a_{i-1},a_{i+1},\ldots,a_N) as the vector of all agents' actions apart from agent i.

Let U_i:A_i\longrightarrow\Bbb{R} be the payoff function for agent i.

A game is defined as [(A_i,U_i); i=1,\ldots,N]. If a graph is continuous you should connect it if it's not then don't connect it.

Definition[edit]

Function U_i:A\longrightarrow\Bbb{R} is graph continuous if for all \mathbf{a}\in A there exists a function F_i:A_{-i}\longrightarrow A_i such that U_i(F_i(\mathbf{a}_{-i}),\mathbf{a}_{-i}) is continuous at \mathbf{a}_{-i}.

Dasgupta and Maskin named this property "graph continuity" because, if one plots a graph of a player's payoff as a function of his own strategy (keeping the other players' strategies fixed), then a graph-continuous payoff function will result in this graph changing continuously as one varies the strategies of the other players.

The property is interesting in view of the following theorem.

If, for 1\leq i\leq N, A_i\subseteq\Bbb{R}^m is non-empty, convex, and compact; and if U_i:A\longrightarrow\Bbb{R} is quasi-concave in a_i, upper semi-continuous in \mathbf{a}, and graph continuous, then the game [(A_i,U_i); i=1,\ldots,N] possesses a pure strategy Nash equilibrium.

References[edit]

  • Partha Dasgupta and Eric Maskin 1986. The existence of equilibrium in discontinuous economic games, I: theory. The Review of Economic Studies, 53(1):1-26