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.

Consider a game with
N
agents with agent
i
having strategy
A
i
⊆
R
; write
a
for an N-tuple of actions (i.e.
a
∈
∏
j
=
1
N
A
j
) and
a
−
i
=
(
a
1
,
a
2
,
…
,
a
i
−
1
,
a
i
+
1
,
…
,
a
N
)
as the vector of all agents' actions apart from agent
i
.

Let
U
i
:
A
i
⟶
R
be the payoff function for agent
i
.

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

Function
U
i
:
A
⟶
R
is **graph continuous** if for all
a
∈
A
there exists a function
F
i
:
A
−
i
⟶
A
i
such that
U
i
(
F
i
(
a
−
i
)
,
a
−
i
)
is continuous at
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
≤
i
≤
N
,
A
i
⊆
R
m
is non-empty, convex, and compact; and if
U
i
:
A
⟶
R
is quasi-concave in
a
i
, upper semi-continuous in
a
, and graph continuous, then the game
[
(
A
i
,
U
i
)
;
i
=
1
,
…
,
N
]
possesses a pure strategy Nash equilibrium.