Provider: JSTOR http://www.jstor.org
Database: JSTOR
Content: text/plain; charset="us-ascii"
TY - CHAP
TI - Example:
AU - Prisner, Erich
AB - As in in the previous chapter we discuss games on graphs. Their most interesting feature is that they always have pure Nash equilibria. Let us repeat the definition of an undirected graph, given in Chapter 4. Undirected graphs have vertices, displayed by small circles. Some pairs of vertices are connected by undirected edges. They are drawn as curves connecting the two vertices. Vertices connected by an edge are called adjacent. Adjacent vertices are also called neighbors. Again we use graphs to model islands. The vertices represent the towns, and the edges the roads between the towns. Student Activity Play the
EP - 41
ET - 1
PB - Mathematical Association of America
PY - 2014
SN - null
SP - 34
T1 - Restaurant Location Games
T2 - Game Theory Through Examples
UR - http://www.jstor.org/stable/10.4169/j.ctt6wpwgj.8
Y2 - 2020/09/19/
ER -