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
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).
Keywords: Chinese Postman games, submodularity, totally balancedness
JEL Classification: C71
Suggested Citation: Suggested Citation
Albizuri, M. Josune and Hamers, Herbert, Graphs Inducing Totally Balanced and Submodular Chinese Postman Games (January 23, 2013). CentER Discussion Paper Series No. 2013-006, Available at SSRN: https://ssrn.com/abstract=2205694 or http://dx.doi.org/10.2139/ssrn.2205694
Do you have negative results from your research you’d like to share?
Recommended Papers
Feedback
Feedback to SSRN
If you need immediate assistance, call 877-SSRNHelp (877 777 6435) in the United States, or +1 212 448 2500 outside of the United States, 8:30AM to 6:00PM U.S. Eastern, Monday - Friday.