A cost-sharing method for an economic lot-sizing game

Operations Research Letters

Volumn 37, Issue 2, 2009, Pages 107-110

  Xu, Dachuan ^a   Yang, Ruichun ^b  

^a BEIJING UNIVERSITY OF TECHNOLOGY   (China)

^b HEBEI NORTH UNIVERSITY   (China)

Author keywords

Approximate cost recovery; Competitiveness; Cross monotonicity; Economic lot sizing game

Indexed keywords

COMPETITION; COST EFFECTIVENESS; DEPRECIATION; GAME THEORY;

APPROXIMATE COST RECOVERY; COMPETITIVENESS; COST-SHARING METHODS; CROSS-MONOTONICITY; NUMERICAL RESULTS; TRIANGLE INEQUALITIES;

COSTS;

EID: 61349183103     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2008.11.001     Document Type: Article

References (21)

1. Manne A.S. Programming of dynamic lot sizes. Management Science 4 (1958) 115-135
2. Wagner H.M., and Whitin T.M. Dynamic version of the economic lot size model. Management Science 5 (1958) 89-96
3. Zangwill W.I. A backlogging model and a multi-echelon model of a dynamic economic lot size production system-a network approach. Management Science 15 (1969) 506-527
4. Moulin H., and Shenker S. Strategyproof sharing of submodular cost: Budget balance versus efficiency. Journal of Economic Theory 18 (2001) 511-533
5. M. Pál, E. Tardös, Group strategyproof mechanisms via primal-dual algorithms, in: Proceedings of the 44th Annual IEEE Symposium on the Foundations of Computer Science, 2003, pp. 584-593
6. Pochet Y., and Wolsey L.A. Lot-size models with backlogging: Strong reformulations and cutting planes. Mathematical Programming 40 (1988) 317-335
7. Devanur N.R., Mihail M., and Vazirani V.V. Strategygyproof cost-sharing mechanisms for set cover and facility location games. Decision Support Systems 39 (2005) 11-22
8. Goemans M.X., and Skutella M. Cooperative facility location games. Journal of Algorithms 50 (2004) 194-214
9. Mahdian M., Ye Y., and Zhang J. Approximation algorithms for metric facility location problems. SIAM Journal on Computing 36 (2006) 411-432
10. Xu D., and Du D. The k-level facility location game. Operations Research Letters 34 (2006) 421-426
11. Zhang J. Approximating the two-level facility location problem via a quasi-greedy approach. Mathematical Programming 108 (2006) 159-176
12. Zhang J., Chen B., and Ye Y. A multi-exchange local search algorithm for the capacitated facility location problem. Mathematics of Operations Research 30 (2005) 389-403
13. van den Heuvel W., Borm P., and Hamers H. Economic lot-sizing games. European Journal of Operational Research 176 (2007) 1117-1130
14. X. Chen, J. Zhang, Duality approaches to economic lot-sizing games, Working paper, Stern School of Business, New York University, 2007
15. Owen G. On the core of linear production games. Mathematical Programming 9 (1975) 358-370
16. Granot D. A generalized linear production model: A unifying model. Mathematical Programming 34 (1986) 212-222
17. Tamir T. On the core of network synthesis games. Mathematical Programming 50 (1991) 123-135
18. R.R. Mettu, C.G. Plaxton, The online median problem, in: Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2000, pp. 339-348
19. Jain K., and Vazirani V.V. Primal-dual approximation algorithms for metric facility location and k-median problems. Jounal of the ACM 48 (2001) 274-296
20. X. Chen, J. Zhang, A stochastic programming duality approach to inventory centralization games, NYU Working Paper No. OM-2006-02, New York University, http://hdl.handle.net/2451/26281
21. Zhang J. Cost allocation for joint replenishment models. Operations Research (2008) 10.1287/opre.1070.0491 Published online in Articles in Advance, July 16