Graphs Inducing Totally Balanced and Submodular Chinese Postman Games

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).

MoreLess

Year of publication:	2013
Authors:	Hamers, H.J.M. ; Josune Albizuri, M.
Institutions:	Tilburg University, Center for Economic Research
Subject:	Chinese Postman games \| submodularity \| totally balancedness

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf
Series:	Discussion Paper.
Type of publication:	Book / Working Paper
Notes:	The text is part of a series CentER Discussion Paper Number 2013-006
Classification:	C71 - Cooperative Games
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10011092295