Abstract 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).
|Place of Publication||Tilburg|
|Number of pages||7|
|Publication status||Published - 2013|
|Name||CentER Discussion Paper|
- Chinese Postman games
- totally balancedness