On Chinese postman games where residents of each road pay the cost of their road

Daniel Granot, Herbert Hamers, Jeroen Kuipers and Michael Maschler

Games and Economic Behavior, 2011, vol. 72, issue 2, 427-438

Abstract: We study the extended Chinese postman (CP) cooperative game induced by a connected, weighted, undirected graph G, wherein a postman, starting from a post office location, needs to traverse all edges wherein players reside, before returning to the post-office. We characterize the graphs associated with all CP games in which the players on a road pay exactly the cost of the road at each core point, regardless of the number of players residing on the road, the location of the post-office and the edge-weight functions. Here, a road is a maximal path all of whose interior vertices have a degree equal to two in G. For this class of games, the core and nucleolus are Cartesian products of CP games induced by simple cyclic graphs, the core is determined by at most 2n-1 constraints and the nucleolus can be computed in time.

Keywords: Cooperative; games; Cost; allocation; Core; Nucleolus; Chinese; postman (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0899825610000308
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:gamebe:v:72:y:2011:i:2:p:427-438

Access Statistics for this article

Games and Economic Behavior is currently edited by E. Kalai

More articles in Games and Economic Behavior from Elsevier
Bibliographic data for series maintained by Catherine Liu ().