Abstract
A multi-depot Chinese postman problem (MDCP) arises from a network (e.g. cityplan) in which several depots are located wherefrom edges (e.g. streets) have to be served. Since costs are involved with each visit to an edge, the objective is to find a minimum cost tour in the network that visits all edges of the network. Such a minimum cost tour consists of a collection of subtours such that the subtours originate from different depots, and each subtour starts and ends at the same depot. This typical OR problem turns into a multi decision maker problem if agents are assigned to the streets. In this new setting the cost of a minimum cost tour that visits all edges have to be paid by the agents. However, now each group of agents (coalition) has the opportunity to find its own minimum cost tour, i.e. a minimum cost tour that only visits the edges owned by the group of agents. Therefore, the main objective is to find allocations of the cost of a minimum tour that visits all agents in such a way that no coalition has higher costs than the costs incurred by its own minimum tour. We will use cooperative game theory to investigate whether these so-called core allocations exist. Therefore, we consider a cooperative Chinese postman (CP) game that is induced by an MDCP by associating every edge of the network with a different agent. In this paper, we characterize classes of networks that ensure the existence of core allocations, the so-called CP balanced graphs, and the existence of specific core allocations, the so-called CP submodular graphs.
Similar content being viewed by others
Notes
In Hamers et al. (1999) the games are called delivery games, while the term Chinese postman (CP) games is used in subsequent publications on this topic.
References
Albizuri, J., & Hamers, H. (2014). Graphs inducing totally balanced and submodular Chinese postman games. Discrete Applied Mathematics, 172, 98–103.
Bednay, D. (2014). Stable sets in one-seller assignment games. Annals of Operations Research, 222, 143–152.
Bergantiños, G., & Sánchez, E. (2002). How to distribute costs associated with a delayed project. Annals of Operations Research, 109, 159–174.
Bogomolnaia, A., & Moulin, H. (2010). Sharing a minimal cost spanning tree: Beyond the Folk solution. Games and Economic Behavior, 69, 238–248.
Curiel, I. (2010). Cooperative game theory and applications: Cooperative games arising from combinatorial optimization problems. Dordrecht: Kluwer.
Deng, X., Ibaraki, T., Nagamochi, H., & Zang, W. (2000). Totally balanced combinatorial optimization games. Mathematical Programming, 87, 441–452.
Edmonds, J., & Johnson, E. (1973). Matching, Euler tours and the Chinese postman. Mathematical Programming, 5, 88–124.
Engevall, S., Göthe-Lundgren, M., & Värbrand, P. (1998). The traveling salesman game: An application of cost allocation in a gas and oil company. Annals of Operations Research, 82, 453–471.
Estévez-Fernández, A. (2012). A game theoretical approach to sharing penalties and rewards in projects. European Journal of Operational Research, 216, 647–657.
Fiestras-Janeiro, M., García-Jurado, I., Meca, A., & Mosquera, M. (2011). Cooperative game theory and inventory management. European Journal of Operational Research, 210, 459–466.
Granot, D. (1986). A generalized linear production model: A unifying model. Mathematical Programming, 34, 212–222.
Granot, D., & Granot, F. (2012). On graphs which can or cannot induce Chinese Postman games with a non-empty core. Discrete Applied Mathematics, 160, 2054–2059.
Granot, D., Granot, F., & Ravichandran, H. (2014). The \(k\)-centrum Chinese Postman delivery problem and a related cost allocation game. Discrete Applied Mathematics, 179, 100–108.
Granot, D., & Huberman, G. (1981). Minimum cost spanning tree games. Mathematical Programming, 21, 1–18.
Granot, D., & Hamers, H. (2004). On the equivalence between some local and global Chinese postman and traveling salesman graphs. Discrete Applied Mathematics, 134, 67–76.
Granot, D., Hamers, H., & Tijs, S. (1999). On some balanced, totally balanced and submodular delivery games. Mathemathical Programming, 86, 355–366.
Hamers, H. (1997). On the concavity of delivery games. European Journal of Operations Research, 99, 445–458.
Hamers, H., Borm, P., van de Leensel, R., & Tijs, S. (1999). Cost allocation in the Chinese postman problem. European Journal of Operations Research, 118, 153–163.
Hamers, H., Klijn, F., & van Velzen, B. (2005). On the convexity of precedence sequencing games. Annals of Operations Research, 137, 161–175.
Hamers, H., Miguel, S., & Norde, H. (2014). Monotonic stable solutions for minimum coloring games. Mathematical Programming, 145, 509–529.
Herer, Y., & Penn, M. (1995). Characterization of naturally submodular graphs: A polynomial solvable class of the TSP. Proceedings of the American Mathematical Society, 123(3), 613–619.
Kansou, A., & Yassine, A. (2010). New upper bounds for the multi-depot capacitated arc routing problem. International Journal of Metaheuristics, 1(1), 81–95.
Maschler, M., Peleg, B., & Shapley, L. (1972). The kernel and bargaining set of convex games. International Journal of Game Theory, 2, 73–93.
Meca, A., Timmer, J., García-Jurado, I., & Borm, P. (2004). Inventory games. European Journal of Operational Research, 156, 127–139.
Okamoto, Y. (2003). Submodularity of some classes of the combinatorial optimization games. Mathematical Methods of Operations Research, 58, 131–139.
Orloff, C. (1974). A fundamental problem of vehicle routing. Networks, 4, 35–62.
Owen, G. (1975). On the core of linear production games. Mathematical Programming, 9, 358–370.
Potters, J., Curiel, I., & Tijs, S. (1992). Traveling salesman games. Mathematical Programming, 53, 199–211.
Shapley, L. S. (1971). Cores of convex games. International Journal of Game Theory, 1, 11–26.
Shapley, L., & Shubik, M. (1973). The assignment game I: The core. International Journal of Game Theory, 1, 111–130.
Slikker, M. (2005). Balancedness of sequencing games with multiple parallel machines. Annals of Operations Research, 137, 177–189.
Wøhlk, S. (2008). A decade of capacitated arc routing problem. In B. Golden, S. Raghavan, & E. Wasil (Eds.), The Vehicle routing problem: Latest advances and new challenges. Berlin: Springer.
Acknowledgments
Financial support from the Danish Council for Strategic Research and The Danish Council for Independent Research | Social Sciences (Grant ID: DFF-1327-00097) is gratefully acknowledged.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Platz, T.T., Hamers, H. On games arising from multi-depot Chinese postman problems. Ann Oper Res 235, 675–692 (2015). https://doi.org/10.1007/s10479-015-1977-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-015-1977-3