Graphs Inducing Totally Balanced and Submodular Chinese Postman Games

H.J.M. Hamers, M. Josune Albizuri

Research output: Working paperDiscussion paperOther research output

279 Downloads (Pure)

Abstract

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).
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages7
Volume2013-006
Publication statusPublished - 2013

Publication series

NameCentER Discussion Paper
Volume2013-006

    Fingerprint

Keywords

  • Chinese Postman games
  • submodularity
  • totally balancedness

Cite this

Hamers, H. J. M., & Josune Albizuri, M. (2013). Graphs Inducing Totally Balanced and Submodular Chinese Postman Games. (CentER Discussion Paper; Vol. 2013-006). Tilburg: Operations research.