Summary
The paper examines an extended model of the Chinese Postman (CP) game which allows for prizes and public edges, that is, edges not belonging to any of the players. The prizes, which are associated with the edges, are collected only upon the first traversal of the edges, and their inclusion in the model is analogous to the introduction of prizes in the traveling salesmen problem. A class of CP-games induced by Eulerian graphs, without public edges, having the 4-cut property is analyzed. In particular, it is shown that both the core and nucleolus are the Cartesian products of the cores and nucleoli of CP-games defined on cycle graphs, which are induced by elementary subpaths in the original graph. Moreover, for CP-games induced by Eulerian graphs having the 4-cut property, but without public edges, one can test core membership in linear time and the nucleolus can be computed in quadratic time.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Balas, E. (1989): The Prize Collecting `Traveling Salesman Problem. Networks 19, 621–636
Bienstock, D., Goemans, M., Simchi-Levi, D., Williamson, D. (1993): A Note on the Prize Collecting Traveling Salesman Problem. Mathematical Programming 59, 413–420
Davis, M., Maschler, M. (1965): The Kernel of a Cooperative Game. Naval Research Logistics Quarterly 12, 223–259
Edmonds, J., Johnson, E. (1973): Matching, Euler Tours and the Chinese Postman. Mathematical Programming 5, 88–124
Granot, D., Hamers, H., Kuipers, J., Maschler, M. (2002): Chinese Postman Games on Some Special Graphs. Working paper, Faculty of Commerce and Business administration, University of British Columbia
Granot, D., Hamers, H., Tijs, S. (1999): On Some Balanced, Totally Balanced and Submodular Games. Mathematical 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. (1994): The Chinese Postman and Delivery Games. European Journal of Operations Research
Kwan, Mei-Ko (1962): Graphic Programming Using Odd or Even Points. Chin. Math. 1, 273–277
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Granot, D., Hamers, H., Kuipers, J., Maschler, M. (2003). On The Chinese Postman Game. In: Petrosyan, L.A., Yeung, D.W.K. (eds) ICM Millennium Lectures on Games. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-05219-8_18
Download citation
DOI: https://doi.org/10.1007/978-3-662-05219-8_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05618-5
Online ISBN: 978-3-662-05219-8
eBook Packages: Springer Book Archive