Graphs Inducing Totally Balanced and Submodular Chinese Postman Games
CentER Discussion Paper Series No. 2013-006
8 Pages Posted: 24 Jan 2013
Date Written: January 23, 2013
A Chinese postman (CP) game is induced by a a weighted undirected, connected graph in which the edges are identified as players and a vertex is chosen as post-office location. Granot and Granot (2012) characterized graphs that give rise to CP games that are balanced. This note completes this line of research by characterizing graphs that give rise to CP games that are submodular (totally balanced, respectively).
Keywords: Chinese Postman games, submodularity, totally balancedness
JEL Classification: C71
Suggested Citation: Suggested Citation