Provider: JSTOR http://www.jstor.org
Database: JSTOR
Content: text/plain; charset="us-ascii"
TY - CHAP
TI - Example:
AU - Prisner, Erich
AB - In this chapter and its sibling on Restaurant Location Games we discuss the simultaneous versions of different location games played on undirected graphs. Like a digraph, an undirected graph consists of vertices. But instead of being connected by arcs with directions, vertices are connected by undirected edge that can be used both ways. Usually they are drawn with curves connecting the vertices. Vertices connected by an edge are called adjacent. Edges may cross, as in the graph in Figure 4.1, where there is an edge connecting vertices 4 and 5, and one connecting vertices 3 and 6, but none connecting
EP - 33
ET - 1
PB - Mathematical Association of America
PY - 2014
SN - null
SP - 25
T1 - Doctor Location Games
T2 - Game Theory Through Examples
UR - http://www.jstor.org/stable/10.4169/j.ctt6wpwgj.7
Y2 - 2020/09/29/
ER -