New techniques for cost sharing in combinatorial optimization games

Mathematical Programming

Volumn 124, Issue 1-2, 2010, Pages 93-118

  Caprara, Alberto ^a   Letchford, Adam N ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b LANCASTER UNIVERSITY   (United Kingdom)

Author keywords

Combinatorial optimization games; Cooperative games; Optimal cost shares; Traveling salesman game; Valid inequalities; Vehicle routing game

Indexed keywords

COMBINATORIAL OPTIMIZATION GAMES; COOPERATIVE GAME; OPTIMAL COSTS; TRAVELING SALESMAN; VALID INEQUALITIES; VALID INEQUALITY;

COSTS;

COMBINATORIAL OPTIMIZATION;

EID: 77955175667     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-010-0357-7     Document Type: Article

References (38)

1. P. Bauer 1997 The circuit polytope: facets Math. Oper. Res. 22 110 145 0871.90099 10.1287/moor.22.1.110 1436576
2. M. Bläser L. Shankar Ram 2008 Approximately fair cost allocation in metric traveling salesman games Theory Comput. Syst. 43 19 37 1135.91313 10.1007/s00224-007-9072-z 2385691
3. O.N. Bondareva 1963 Some applications of linear programming to cooperative games Problemy Kibernetiki. 10 119 139 167335
4. Bramel J., Simchi-Levi D.: Set-covering-based algorithms for the capacitated VRP. In: Toth, P., Vigo, D. (eds) The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications SIAM, Philadelphia (2002)
5. G.B. Dantzig P. Wolfe 1960 Decomposition principle for linear programs Oper. Res. 8 101 111 0093.32806 10.1287/opre.8.1.101
6. de Aragaõ M.P., Uchoa E.: Integer program reformulation for robust branch-and-cut-and-price. In: Wosley, L. (eds) Annals of Mathematical Programming in Rio, pp. 56-61. Búzios, Brazil (2003)
7. X. Deng T. Ibaraki H. Nagamochi 1999 Algorithmic aspects of the core of combinatorial optimization games Math. Oper. Res. 24 751 766 1064.91505 10.1287/moor.24.3.751 1854251
8. J. Edmonds 1965 Maximum matching and a polyhedron with 0,1-vertices J. Res. Natl. Bur. Stand. 69 125 130 0141.21802 183532
9. U. Faigle S.P. Fekete W. Hochstättler W. Kern 1998 On approximately fair cost allocation for the Euclidean traveling salesman problem OR Spektrum 20 29 37 0897.90199 10.1007/BF01545526
10. Fekete, S.P., Pulleyblank, W.R.: A note on the traveling preacher problem. Report No. 98.331, Angewandte Mathematik und Informatik, Universität zu Köln (1998)
11. Fukasawa, R., Lysgaard, J., de Aragão, M.P., Reis, M., Uchoa, E., Werneck, R.F.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem. In Nemhauser, G., Bienstock, D. (eds.) Integer Programming and Combinatorial Optimization 10, pp. 1-15. Lecture Notes in Computer Science 3064, Berlin, Springer (2004)
12. Gillies D.B.: Solutions to general non-zero-sum games. In: Tucker, A.W., Luce, R.D. (eds) Contributions to the Theory of Games, vol. 4, pp. 47-85. Princeton University Press, Princeton (1959)
13. Goemans, M.X.: Private communication (2004)
14. M.X. Goemans M. Skutella 2004 Cooperative facility location games J. Algorithms 50 194 214 1106.91009 10.1016/S0196-6774(03)00098-1 2049792
15. M. Göthe-Lundgren K. Jörnsten P. Värbrand 1996 On the nucleolus of the basic vehicle routing game Math. Program. 72 83 100 10.1007/BF02592333
16. D. Granot G. Huberman 1981 Minimum cost spanning tree games Math. Program. 21 1 18 0461.90099 10.1007/BF01584227 618611
17. Grötschel M., Lovász L., Schrijver A.: Geometric Algorithms and Combinatorial Optimization. Springer, Berlin (1988)
18. M. Grötschel M.W. Padberg 1979 On the symmetric travelling salesman problem I: inequalities Math. Program. 16 265 280 0413.90048 10.1007/BF01582116
19. Grötschel M., Padberg M.W. et al.: Polyhedral theory. In: Lawler, E.L. (eds) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, Chichester (1985)
20. M. Grötschel W. Pulleyblank 1986 Clique tree inequalities and the symmetric travelling salesman problem Math. Oper. Res. 11 537 569 0626.90060 10.1287/moor.11.4.537 865552
21. L. Gouveia 1995 A result on projection for the vehicle routing problem Eur. J. Opl. Res. 85 610 684 0912.90118 10.1016/0377-2217(94)00025-8
22. D.J. Houck J.-C. Picard M. Queyranne R.R. Vemuganti 1980 The travelling salesman problem as a constrained shortest path problem: theory and computational experience Opsearch 17 93 109 0446.90084 605414
23. Jain K., Mahdian M.: Cost sharing. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V. (eds) Algorithmic Game Theory, Cambridge University Press, Cambridge (2007)
24. A.N. Letchford R.W. Eglese J. Lysgaard 2002 Multistars, partial multistars and the capacitated vehicle routing problem Math. Program. 94 21 40 1023.90073 10.1007/s10107-002-0336-8 1953164 (Pubitemid 44744729)
25. A.N. Letchford J.J. Salazar Gonzalez 2006 Projection results for vehicle routing Math. Program. 105 251 274 1085.90032 10.1007/s10107-005-0652-x 2190821 (Pubitemid 41788320)
26. Naddef D.: Polyhedral theory and branch-and-cut algorithms for the symmetric TSP. In: Gutin, G., Punnen, A. (eds) The Traveling Salesman Problem and Its Variations, Kluwer, Dordrecht (2001)
27. D. Naddef G. Rinaldi 1991 The symmetric traveling salesman polytope and its graphical relaxation: composition of valid inequalities Math. Program. 51 359 400 0748.90072 10.1007/BF01586945 1130332
28. von Neumann J., Morgenstern O.: Theory of Games and Economic Behaviour. Princeton University Press, Princeton (1947)
29. Y. Okamoto 2004 Traveling salesman games with the Monge property Discr. Appl. Math. 138 349 369 1056.90120 10.1016/j.dam.2003.08.005
30. M.W. Padberg M.R. Rao 1982 Odd minimum cut-sets and b-matchings Math. Oper. Res. 7 67 80 0499.90056 10.1287/moor.7.1.67 665219
31. Pal, M., Tardos, E.: Group strategy proof mechanisms via primal-dual algorithms. In: Proceedings of the 44th annual IEEE symposium on foundations of computer science (FOCS 2003), pp. 584-593 (2003)
32. Peleg B., Sudholter P.: Introduction to the Theory of Cooperative Games. Kluwer, Dordrecht (2003)
33. J.A.M. Potters I.J. Curiel S.H. Tijs 1992 Traveling salesman games Math. Program. 53 199 211 0749.90094 10.1007/BF01585702 1148013
34. Seymour P.D.: Sums of circuits. In: Bondy, J.A., Murty, U.S.R. (eds) Graph Theory and Related Topics, pp. 341-355. Academic Press, London (1979)
35. L.S. Shapley 1967 On balanced sets and cores Nav. Res. Log. Quart. 14 453 460 10.1002/nav.3800140404
36. L.S. Shapley M. Shubik 1972 The assignment game I: the core Int. J. Game Theory 1 111 130 10.1007/BF01753437 311290
37. Shubik, M.: Game theory models and methods in political economy. In Arrow, K.J., Intriligator, M.D. (eds.) Handbook of Mathematical Economics, vol. I. North-Holland, pp. 285-330 (1981)
38. A. Tamir 1988 On the core of a traveling salesman cost allocation game Oper. Res. Lett. 8 31 34 10.1016/0167-6377(89)90030-8 983571