Benefit sharing in holding situations

European Journal of Operational Research

Volumn 162, Issue 1, 2005, Pages 251-269

  Tijs, Stef ^a   Meca, Ana ^b   López, Marco A ^c  

^a TILBURG UNIVERSITY   (Netherlands)

^b MIGUEL HERNÁNDEZ UNIVERSITY   (Spain)

^c UNIVERSITY OF ALICANTE   (Spain)

Author keywords

Benefit sharing; Big boss games; Cooperative games; Equilibrium allocation; Holding games; Holding situations

Indexed keywords

COMPUTER SIMULATION; DATA STORAGE EQUIPMENT; GAME THEORY; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING;

BENEFIT SHARING; BIG BOSS GAMES; COOPERATIVE GAMES; EQUILIBRIUM ALLOCATION; HOLDING GAMES; HOLDING SITUATIONS;

OPERATIONS RESEARCH;

EID: 8344230769     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2003.06.030     Document Type: Conference Paper

References (28)

1. Aumann R.J., Maschler M. The bargaining set for cooperative games. Dresher M., Shapley L.S., Tucker A.W. Advances in Game Theory. 1964;443-447 Princeton University Press.
2. Bertsekas D.P. Nonlinear Programming. 1995;Athena Scientific, Belmont, MA.
3. Davis M., Maschler M. The kernel of a cooperative game. Naval Research Logistic Quarterly. 12:1965;223-259.
4. Driessen T.H.S. Cooperative Games, Solutions and Applications. 1988;Kluwer Academic Publisher, Dordrecht, The Netherlands.
5. Gillies, D.B., 1953. Some theorems on n-person games. Ph.D. Dissertation, Department of Mathematics, Princeton University.
6. Held M., Wolfe P., Crowder H.P. Validation of subgradient optimization. Mathematical Programming. 6:1974;62-88.
7. Hiriart-Urruty J.-B., Lemaréchal C. Convex Analysis and Minimization Algorithms I. 1993;Springer-Verlag, Berlin Heidelberg.
8. Kao C.Y., Meyer R.R. Secant approximation methods for convex optimization. König H., et al. Mathematical Programming Study 14. 1981;143-162 North-Holland, Amsterdam.
9. Lemaréchal C. Nondifferentiable optimization. Nemhauser G.L., et al. Optimization. Handbooks in Operations Research and Management Science. vol. 1:1989;Noth-Holland, Amsterdam.
10. Lemaréchal C., Zowe J. Some remarks on the construction of higher order algorithms for convex optimization. Applied Mathematics and Optimization. 10:1983;51-68.
11. Meca, A., Timmer, J., García-Jurado, I., Borm, P.E.M. Inventory games. European Journal of Operational Research, 2003, in press.
12. Muto S., Nakayama M., Potters J., Tijs S.H. On big boss games. The Economic Studies Quarterly. 39:1988;303-321.
13. Nedić A., Bersekas D.P. Convergence rate of incremental subgradient algorithms. Uryasev S., Pardalos P.M. Stochastic Optimization: Algorithms and Applications. 2000;263-304 Kluwer, Dordrecht.
14. Nemirosky A.S., Yudin D.B. Problem complexity and method efficiency in optimization. 1983;Wiley, New York.
15. Potters J., Poos R., Tijs S.H., Muto S. Clan games. Games and Economic Behavior. 1:1989;275-293.
16. Rockafellar R.T. Convex Analysis. 1970;Princeton University Press, Princeton, NJ.
17. Rockafellar R.T. The theory of subgradients and its applications to problems of optimization. Convex and nonconvex functions. Hofmann K.H., Wille R. Research and Education in Mathematics. 1981;Heldermann Verlag, Berlin.
18. Rockafellar R.T. Network Flows and Monotropic Programming. 1984;Wiley-Interscience, New York.
19. Schmeidler D. The nucleolus of a characteristic function game. SIAM Journal of Applied Mathematics. 17:1969;1163-1170.
20. Shapley L.S. A value for N-person games. Kuhn H.W., Tucker A.W. Contributions to the Theory of Games II. 1953;307-317 Princeton University Press.
21. Shapley L.S. Cores of convex games. International Journal of Game Theory. 1:1971;11-26.
22. Shor N.Z. Minimization Methods for Nondifferentiable Functions. 1985;Springer-Verlag, Berlin.
23. Tijs S.H. Bounds for the core and the. τ -value Moeschlin O., Pallaschke D. Game Theory and Mathematical Economics. 1981;123-132 North-Holland Publishing Company, Amsterdam.
24. Tijs S.H. Big boss games, clan games and information games. Ichiishi T., Neyman A., Tauman Y. Game Theory and its Applications. 1990;283-286 Academic Press Inc.
25. Tseng P. An. ε -out-of-kilter method for monotropic programming Mathematics of Operations Research. 26:2001;221-233.
26. von Neumann J., Morgenstern O. Theory of Games and Economic Behavior. 1947;Princeton University Press.
27. Wolfe P. A method of conjugate subgradients for minimizing nondifferentiable functions. Balinski M.L., Wolfe P. Nondifferentiable Optimization, Mathematical Programming Study 3. 1985;145-173 North-Holland, Amsterdam.
28. Zowe J. Nondifferentiable optimization. Schittkowski K. Computational Mathematical Programming. 1985;323-356 Springer-Verlag, Berlin.