On approximately fair cost allocation in Euclidean TSP games

OR Spectrum

Volumn 20, Issue 1, 1998, Pages 29-37

  Faigle, Ulrich ^a   Fekete, Sándor P ^b   Hochstättler, Winfried ^b   Kern, Walter ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b UNIVERSITY OF COLOGNE   (Germany)

Author keywords

Cooperative game; Core; Cost allocation; Held karp bound; Traveling salesman

Indexed keywords

EID: 85047673979     PISSN: 01716468     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01545526     Document Type: Article

References (32)

1. Aarts H, Driessen TSH (1993) The irreducible core of a minimum cost spanning tree game. Zeitschrift für Operations Research 38:163-174
2. Bird CG (1976) On cost allocation for a spanning tree: a game theoretic approach. Networks 6:335-350
3. Boyd SC (1986) The subtour polytope of the traveling salesman polytope. Ph.D. Thesis, University of Waterloo, Waterloo, Ontario
4. Boyd SC, Pulleyblank WR (1990) Optimization over the subtour polytope of the traveling salesman polytope. Mathematical Programming 49:163-187
5. Cornuejols G, Fonlupt J, Naddef D (1985) The traveling salesman problem on a graph and some related integer polyhedra. Mathematical Programming 33:1-27
6. Dantzig GB, Fulkerson DR, Johnson SM (1954) Solutions of a largescale traveling salesman problem. Operations Research 2:393-410
7. Faigle U, Kern W (1993) On some approximately balanced combinatorial cooperative games. Zeitschrift für Operations Research 38:141-152
8. Faigle U, Fekete SP, Hochstättler H, Kern W (1996) On the complexity of testing membership in the core of min-cost spanning tree games. International Journal of Game Theory (to appear)
9. Fekete SP (1992) Geometry and the traveling salesman problem. Ph.D. Thesis, University of Waterloo, Waterloo, Ontario
10. Feller W (1971) An introduction to probability theory and its applications. Wiley, New York
11. Garey MR, Johnson DS (1979) Computers and intractability. A guide to the theory of NP-completeness. Freeman, New York
12. Goemans MX (1990) Analysis of LP-relaxations for a class of connectivity problems. Ph.D. Thesis, MIT, Boston, MA
13. Granot D, Hubermann G (1981) Minimum cost spanning tree games. Math Progr 21:1-18
14. Grötschel M, Lovász L, Schrijver A (1981) The ellipsoid method and its consequences. Combinatorica 1:169-197
15. Hunting M (1993) De least-core epsilon voor euclidische TSP-spelen met weinig speiers. Diploma thesis, University of Twente
16. Jünger M, Pulleyblank WR (1993) Geometric duality and combinatorial optimization. In: Chatterji SD, Fuchssteiner B, Kulisch U, Liedl R (eds) Jahrbuch Überblicke Mathematik. Vieweg, Braunschweig
17. Karp R, Papadimitriou C (1980) On linear characterizations of combinatorial optimization problems. Proceedings of the Twenty-first Annual Symposium on the Foundations of Computer Science. IEEE Press, New York, pp. 1-9
18. Kuipers J (1991) A note on the 5-person Traveling Salesman game. Technical Report, University of Limburg, The Netherlands
19. Nemhauser GL, Wolsey LA (1988) Integer and combinatorial optimization. Wiley, New York
20. Neumann J v, Morgenstern O (1944) Theory of games and economic behavior. Princeton University Press, Princeton
21. Owen G (1975) On the core of linear production games. Math Progr 9:358-370
22. Padberg MW, Hong S (1980) On the symmetric traveling salesman problem: a combinatorial study. Mathematical Programming Study 12:78-107
23. Padberg MW, Rao MR (1982) Odd minimum cut-sets and b-matchings. Mathematics of Operations Research 7:67-80
24. Padberg MW, Wolsey LA (1983) Trees and cuts. Annals of Discrete Mathematics 17:511-517
25. Potters J, Curiel I, Tijs S (1992) Traveling salesman games. Math Progr 53:199-211
26. Pulleyblank WR (1973) Faces of matching polyhedra. Ph.D. Thesis, University of Waterloo, Waterloo, Ontario
27. Shmoys D, Williamson D (1990) Analyzing the Held-Karp TSP bound: a monotonicity property with applications. Information Processing Letters 35:281-285
28. Shubik M (1981) Game theory models and methods in political economy. In: Arrows KJ et al. (eds) Handbook of Mathematical Economics, vol. 1. North-Holland, New York, pp. 285-330
29. Steele JM (1990) Probabilistic and worst case analysis of classical problems of combinatorial optimization in Euclidean space. Mathematics of OR 15(4):749-770
30. Tamir A (1989) On the core of a traveling salesman cost allocation game. OR Letters 9:31-34
31. Tamir A (1991) On the core of network synthesis games. Math Progr 50:23-135
32. Wolsey LA (1980) Heuristic analysis, linear programming and branch and bound. Mathematical Programming Study 13:121-134