Graph continuous function

From HandWiki - Reading time: 2 min

Short description: Concept in game theory

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

Consider a game with N agents with agent i having strategy AiR; write a for an N-tuple of actions (i.e. aj=1NAj) and ai=(a1,a2,,ai1,ai+1,,aN) as the vector of all agents' actions apart from agent i.

Let Ui:AiR be the payoff function for agent i.

A game is defined as [(Ai,Ui);i=1,,N].

Definition

Function Ui:AR is graph continuous if for all aA there exists a function Fi:AiAi such that Ui(Fi(ai),ai) is continuous at ai.

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 1iN, AiRm is non-empty, convex, and compact; and if Ui:AR is quasi-concave in ai, upper semi-continuous in a, and graph continuous, then the game [(Ai,Ui);i=1,,N] possesses a pure strategy Nash equilibrium.

References

  • 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




Licensed under CC BY-SA 3.0 | Source: https://handwiki.org/wiki/Graph_continuous_function
22 views | Status: cached on July 24 2024 15:32:00
↧ Download this article as ZWI file
Encyclosphere.org EncycloReader is supported by the EncyclosphereKSF