Justo Puerto
ABSTRACT
In this paper we introduce and analyze new classes of cooperative games related to facility location models defined on general metric spaces. The players are the customers (demand points) in the location problem and the characteristic value of a coalition is the cost of serving its members. Specifically, the cost in our games is either the service radius or the diameter of the coalition.
We study the existence of core allocations for these games, focusing on network spaces, i.e., finite metric spaces induced by undirected graphs and positive edge lengths, and on finite dimension vector spaces endowed with a norm (Rd).
- P. Borm, H. Hamers, R. Hendrickx, "Operations research games: A survey," TOP, 9:139--216 (2001).Google Scholar
Cross Ref
- C. G. Bird, "On cost allocation for a spanning tree: A game theoretic approach," Networks, 6:335--350 (1976).Google ScholarCross Ref
- A. Claus, D. J. Kleitman, "Cost allocation for a spanning tree," Networks, 3:289--304 (1973).Google ScholarCross Ref
- X. Deng, T. Ibaraki, H. Nagamochi, "Algorithmic aspects of the core of combinatorial optimization games," Mathematics of Operations Research, 24: 751--766 (1999). Google ScholarDigital Library
- X. Deng, T. Ibaraki, H. Nagamochi, W. Zang "Totally balanced combinatorial optimization games," Mathematical Programming, 87: 441--452 (2000).Google ScholarCross Ref
- X. Deng, C. H. Papadimitrou, "On the complexity of cooperative solution concepts," Mathematics of Operations Research, 19: 257--266 (1994). Google ScholarDigital Library
- U. Faigle, S. Fekete, W. Hochstatler, W. Kern, "On the complexity of testing membership in the core of the min cost spanning tree games," International Journal of Game Theory, 26: 361--366 (1997). Google ScholarDigital Library
- U. Faigle, W. Kern, "On the core of ordered submodular cost games," Mathematical Programming 87: 483--499 (2000).Google ScholarCross Ref
- U. Faigle, W. Kern, J. Kuipers, "Computing the nucleolus of the min cost spanning tree games is NP-hard," International Journal of Game Theory, 27: 443--450 (1998). Google ScholarDigital Library
- U. Faigle, W. Kern, J. Kuipers, "On the computation of the nucleolus of a cooperative game," International Journal of Game Theory, 30: 79--98 (2001). Google ScholarDigital Library
- M. X. Goemans, M. Skutella, "Cooperative facility location games," J. of Algorithms, 50: 194--214 (2004). Google ScholarDigital Library
- D. Granot, "A generalized linear production model: A unifying model," Mathematical Programming, 34: 212--223 (1986). Google ScholarDigital Library
- D. Granot, "On the role of cost allocation in locational analysis," Operations Research, 35: 234--248 (1987). Google ScholarDigital Library
- D. Granot, G. Huberman, "Minimum cost spanning tree games," Mathematical Programming, 21: 1--18 (1981).Google ScholarDigital Library
- D. Granot, G. Huberman, "On the core and nucleolus of minimum cost spanning tree games," Mathematical Programming, 29: 323--347 (1984).Google ScholarDigital Library
- R. Hassin, A. Tamir, "On the minimum diameter spanning tree problem," Information Processing Letters, 53: 109--111 (1995). Google ScholarDigital Library
- E. Kalai, E. Zemel, "Totally balanced games and games of flow," Mathematics of Operations Research, 7:476--478 (1982).Google ScholarDigital Library
- E. Kalai, E. Zemel, " Generalized network problems yielding totally balanced games and balanced games," Operations Research, 30:998--1008 (1982).Google ScholarDigital Library
- E. Kohlberg, "The nucleolus as a solution of a minimization problem," SIAM J. Appl. Math., 23: 34--39 (1972).Google ScholarDigital Library
- A. Kolen, A. Tamir, "Covering problems," Chapter 10 in Discrete Location Theory, P. B. Mirchandani, R. L. Francis (eds.), Wiley, New York, 1990.Google Scholar
- J. Kuipers, "A note on the 5-person traveling salesman game," Zeitschrift fur Operations Research, 21: 339--351, (1991).Google Scholar
- J. Kuipers, "A polynomial time algorithm for computing the nucleolus of convex games," Report M 96-12, 1996, Maastricht University.Google Scholar
- Y. Liu, J. Huang, "Diameter-preserving spanning trees in sparse weighted graphs," Technical Report, Department of Mathematics, Tongji University, Shanghai, China, 2009.Google Scholar
- A. Levin, A., Private communication, April 2008.Google Scholar
- M. Maschler, B. Peleg, L. S. Shapley, " The kernel and the bargaining set for convex games," International Journal of Game Theory, 1: 73--93 (1972).Google ScholarDigital Library
- N. Megiddo, "Computational complexity of the game theory approach to cost allocation for a tree," Mathematics of Operations Research 3:189--196 (1978).Google ScholarDigital Library
- N. Megiddo, "Cost allocation for Steiner trees," Networks, 8:1--6 (1978).Google ScholarCross Ref
- H. M. Mulder, "The structure of median graphs," Discrete Mathematics 25:197--204 (1978).Google ScholarCross Ref
- H. M. Mulder, "The interval function of a graph," Math. Center Tracts 132, (1980), Amsterdam.Google Scholar
- J. von Neumann, O. Morgenstern, Theory of Games and Economic Behavior, Princeton University Press, Princeton, third edition, 1953.Google Scholar
- G. Owen, "On the core of linear production games," Mathematical Programming, 9:358--370 (1975).Google ScholarCross Ref
- J. Puerto, I. García Jurado, F. R. Fernández, "On the core of a class of Location Games," Mathematical Methods of Operations Research, 54:373--385 (2001).Google ScholarCross Ref
- L. S. Shapley, "Cores of convex games," International Journal of Game Theory, 1: 11--26 (1971).Google ScholarDigital Library
- L. S. Shapley, M. Shubik, "The assignment game I: The core," International Journal of Game Theory, 1: 111--130 (1971).Google ScholarDigital Library
- A. Tamir, "On the core of a traveling salesman cost allocation game," Operations Research Letters, 8:31--34 (1989).Google ScholarDigital Library
- A. Tamir, "On the core of network synthesis games," Mathematical Programming, 50: 123--135 (1991). Google ScholarDigital Library
- A. Tamir, "On the core of cost allocation games defined on location problems," Transportation Science, 27: 81--86 (1992).Google ScholarDigital Library
- A. Tamir, "A unifying location model on tree graphs based on submodularity properties," Discrete Applied Mathematics 47:275--283 (1993). Google ScholarDigital Library
- E. Tardos, "A strongly polynomial algorithm to solve combinatorial linear programs," Operations Research, 34: 250--256 (1986). Google ScholarDigital Library
- S. Zurcher, "Smallest enclosing ball for a point set with strictly convex level sets," Masters Thesis, Institute of Theoretical Computer Science, ETH Zurich, 2007.Google Scholar
Index Terms
- Some new cooperative coverage facility location games
Recommendations
Shapley Facility Location Games
Web and Internet EconomicsAbstractFacility location games have been a topic of major interest in economics, operations research and computer science, starting from the seminal work by Hotelling. Spatial facility location models have successfully predicted the outcome of ...
Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
In this paper we introduce and analyze new classes of cooperative games related to facility location models. The players are the customers (demand points) in the location problem and the characteristic value of a coalition is the cost of serving its ...
Preferred coalitions in cooperative differential games
There are many interesting situations which can be described by anN-person general-sum differential game. Such games are characterized by the fact that the strategy of each player depends upon reasonable assumptions about the strategies of the remaining ...
Comments