Graphs Inducing Totally Balanced and Submodular Chinese Postman Games

CentER Discussion Paper Series No. 2013-006

8 Pages Posted: 24 Jan 2013

See all articles by M. Josune Albizuri

M. Josune Albizuri

University of the Basque Country

Herbert Hamers

Tilburg University - Center for Economic Research (CentER); Tilburg University - Department of Econometrics & Operations Research

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

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

M. Josune Albizuri (Contact Author)

University of the Basque Country ( email )

Lehendakari Agirre, 83
Leioa, Bizkaia 48940
Spain

Herbert Hamers

Tilburg University - Center for Economic Research (CentER) ( email )

P.O. Box 90153
Tilburg, 5000 LE
Netherlands
+31 13 4666 2660 (Phone)

Tilburg University - Department of Econometrics & Operations Research

Tilburg, 5000 LE
Netherlands

Do you have negative results from your research you’d like to share?

Paper statistics

Downloads
31
Abstract Views
497
PlumX Metrics