IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Login to save this article or follow this journal

Operations research games: A survey

  • Peter Borm

    ()

  • Herbert Hamers

    ()

  • Ruud Hendrickx

    ()

This paper surveys the research area of cooperative games associated with several types of operations research problems in which various decision makers (players) are involved.Cooperating players not only face a joint optimisation problem in trying, e.g., to minimise total joint costs, but also face an additional allocation problem in how to distribute these joint costs back to the individual players.This interplay between optimisation and allocation is the main subject of the area of operations research games.It is surveyed on the basis of a distinction between the nature of the underlying optimisation problem: connection, routing, scheduling, production and inventory.

(This abstract was borrowed from another version of this item.)

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://hdl.handle.net/10.1007/BF02579075
Download Restriction: Access to full text is restricted to subscribers.

As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

Article provided by Springer in its journal Top.

Volume (Year): 9 (2001)
Issue (Month): 2 (December)
Pages: 139-199

as
in new window

Handle: RePEc:spr:topjnl:v:9:y:2001:i:2:p:139-199
Contact details of provider: Web page: http://www.springerlink.com/link.asp?id=120409

Order Information: Web: http://link.springer.de/orders.htm

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

as in new window
  1. Sprumont, Y., 1996. "Ordinal Cost Sharing," Cahiers de recherche 9624, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
  2. Vito Fragnelli & Ignacio García-Jurado & Luciano Méndez-Naya, 2000. "On shortest path games," Mathematical Methods of Operations Research, Springer, vol. 52(2), pages 251-264, November.
  3. Solymosi, Tamas & Raghavan, Tirukkannamangai E S, 1994. "An Algorithm for Finding the Nucleolus of Asignment Games," International Journal of Game Theory, Springer, vol. 23(2), pages 119-43.
  4. Young, H. P., 1988. "Distributive justice in taxation," Journal of Economic Theory, Elsevier, vol. 44(2), pages 321-335, April.
  5. repec:adr:anecst:y:1992:i:25-26:p:03 is not listed on IDEAS
  6. Borm, P.E.M. & Fiestras-Janeiro, G. & Hamers, H.J.M. & Sánchez, E. & Voorneveld, M., 1999. "On the Convexity of Games Corresponding to Sequencing Situations with Due Dates," Discussion Paper 1999-49, Tilburg University, Center for Economic Research.
  7. Derks, J.J.M. & Tijs, S.H., 1986. "Totally balanced multi-commodity games and flow games," Other publications TiSEM a3b62c80-5fbd-4864-9764-a, Tilburg University, School of Economics and Management.
  8. Curiel, I. & Hamers, H.J.M. & Tijs, S.H. & Potters, J.A.M., 1997. "Restricted component additive games," Other publications TiSEM c59f5d9a-2df2-4719-92c4-5, Tilburg University, School of Economics and Management.
  9. Hamers, Herbert & Klijn, Flip & Solymosi, Tamas & Tijs, Stef & Vermeulen, Dries, 2003. "On the nucleolus of neighbor games," European Journal of Operational Research, Elsevier, vol. 146(1), pages 1-18, April.
  10. Borm, P.E.M. & De Waegenaere, A.M.B. & Rafels, C. & Suijs, J.P.M. & Tijs, S.H. & Timmer, J.B., 2001. "Cooperation in capital deposits," Other publications TiSEM de31df8b-638a-43b2-b79e-f, Tilburg University, School of Economics and Management.
  11. L. S. Shapley & Martin Shubik, 1967. "Ownership and the Production Function," The Quarterly Journal of Economics, Oxford University Press, vol. 81(1), pages 88-111.
  12. Klijn, F. & Tijs, S.H. & Hamers, H.J.M., 1999. "Balancedness of Permutation Games and Envy-Free Allocations in Indivisible Good Economies," Discussion Paper 1999-21, Tilburg University, Center for Economic Research.
  13. Hamers, H.J.M., 1995. "Sequencing and delivery situations : A game theoretic approach," Other publications TiSEM f2cbf2cf-aa4e-4f9d-b46d-7, Tilburg University, School of Economics and Management.
  14. Vito Fragnelli & Fioravante Patrone & Enrico Sideri & Stef Tijs, 1999. "Balanced games arising from infinite linear models," Mathematical Methods of Operations Research, Springer, vol. 50(3), pages 385-397, December.
  15. Hamers, Herbert & Klijn, Flip & Suijs, Jeroen, 1999. "On the balancedness of multiple machine sequencing games," European Journal of Operational Research, Elsevier, vol. 119(3), pages 678-691, December.
  16. Aadland, David & Kolpin, Van, 1998. "Shared irrigation costs: An empirical and axiomatic analysis," Mathematical Social Sciences, Elsevier, vol. 35(2), pages 203-218, March.
  17. Aumann, Robert J. & Maschler, Michael, 1985. "Game theoretic analysis of a bankruptcy problem from the Talmud," Journal of Economic Theory, Elsevier, vol. 36(2), pages 195-213, August.
  18. Nouweland, C.G.A.M. & Tijs, S.H. & Maschler, M., 1993. "Monotonic games are spanning network games," Other publications TiSEM 023e2cfe-5261-4ab3-8649-2, Tilburg University, School of Economics and Management.
  19. Norde, H.W. & Moretti, S. & Tijs, S.H., 2004. "Minimum cost spanning tree games and population monotonic allocation schemes," Other publications TiSEM bcaf99d7-5b94-437f-a89c-d, Tilburg University, School of Economics and Management.
  20. Feltkamp, V. & Koster, A. & Van Den Nouweland, A. & Borm, P. & Tijs, S., 1993. "Linear Production with Transport of Products, Resources and Technology," Papers 9332, Tilburg - Center for Economic Research.
  21. van den Nouweland, Anne & Tijs, Stef & Maschler, Michael, 1993. "Monotonic Games Are Spanning Network Games," International Journal of Game Theory, Springer, vol. 21(4), pages 419-27.
  22. Mamoru Kaneko, 1980. "The Central Assignment Game and the Assignment Markets," Cowles Foundation Discussion Papers 563, Cowles Foundation for Research in Economics, Yale University.
  23. Sandsmark, M., 1999. "Production Games under Uncertainty," Norway; Department of Economics, University of Bergen 204, Department of Economics, University of Bergen.
  24. van Gellekom, J. R. G. & Potters, J. A. M. & Reijnierse, J. H. & Engel, M. C. & Tijs, S. H., 2000. "Characterization of the Owen Set of Linear Production Processes," Games and Economic Behavior, Elsevier, vol. 32(1), pages 139-156, July.
  25. Daniel Granot & Michael Maschler, 1998. "Spanning network games," International Journal of Game Theory, Springer, vol. 27(4), pages 467-500.
  26. Kaminski, Marek M., 2000. "'Hydraulic' rationing," Mathematical Social Sciences, Elsevier, vol. 40(2), pages 131-155, September.
  27. Hamers, H. & Borm, P. & Tijs, S., 1993. "A Games Corresponding to Sequencing Situations with Ready Times," Papers 9316, Tilburg - Center for Economic Research.
  28. Sandsmark, Maria, 1999. "Production Games under Uncertainty," Computational Economics, Society for Computational Economics, vol. 14(3), pages 237-53, December.
  29. Curiel, I. & Pederzoli, G. & Tijs, S.H., 1989. "Sequencing games," Other publications TiSEM cd695be5-0f54-4548-a952-2, Tilburg University, School of Economics and Management.
  30. Feltkamp, V. & Tijs, S.H. & Muto, S., 1994. "Minimum cost spanning extension problems : The proportional rule and the decentralized rule," Discussion Paper 1994-96, Tilburg University, Center for Economic Research.
  31. Dov Samet & Eitan Zemel, 1981. "On the Core and Dual Set of Linear Programming Games," Discussion Papers 485, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  32. Moulin Herve & Shenker Scott, 1994. "Average Cost Pricing versus Serial Cost Sharing: An Axiomatic Comparison," Journal of Economic Theory, Elsevier, vol. 64(1), pages 178-201, October.
  33. Granot, D. & Hamers, H.J.M. & Tijs, S.H., 1999. "On some balanced, totally balanced and submodular delivery games," Other publications TiSEM e0496604-0162-4a27-992c-a, Tilburg University, School of Economics and Management.
  34. Pradeep Dubey, 1982. "The Shapley Value as Aircraft Landing Fees--Revisited," Management Science, INFORMS, vol. 28(8), pages 869-874, August.
  35. Potters, J.A.M. & Curiel, I. & Tijs, S.H., 1992. "Traveling salesman games," Other publications TiSEM 0dd4cf3d-25fa-4179-80f6-6, Tilburg University, School of Economics and Management.
  36. Derks, J.J.M. & Tijs, S.H., 1985. "Stable outcomes for multi-commodity flow games," Other publications TiSEM f643e6a4-cf4e-4892-8f00-c, Tilburg University, School of Economics and Management.
  37. Imma Curiel & Herbert Hamers & Stef Tijs & Jos Potters, 1997. "Restricted component additive games," Mathematical Methods of Operations Research, Springer, vol. 45(2), pages 213-220, June.
  38. Sasaki, Hiroo, 1995. "Consistency and Monotonicity in Assignment Problems," International Journal of Game Theory, Springer, vol. 24(4), pages 373-97.
  39. Ehud Kalai & Eitan Zemel, 1980. "Generalized Network Problems Yielding Totally Balanced Games," Discussion Papers 425, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  40. Sanchez-Soriano, Joaquin & Lopez, Marco A. & Garcia-Jurado, Ignacio, 2001. "On the core of transportation games," Mathematical Social Sciences, Elsevier, vol. 41(2), pages 215-225, March.
  41. Quint, Thomas, 1991. "Characterization of Cores of Assignment Games," International Journal of Game Theory, Springer, vol. 19(4), pages 413-20.
  42. Marco Scarsini & Alfred Muller & Moshe Shaked, 2002. "The newsvendor game has a non-empty core," Post-Print hal-00539841, HAL.
  43. repec:fth:tilbur:99111 is not listed on IDEAS
  44. repec:spr:compst:v:45:y:1997:i:2:p:213-220 is not listed on IDEAS
  45. Curiel, I. & Tijs, S.H., 1986. "Assignment games and permutation games," Other publications TiSEM c9a47c3b-28d3-4874-b0a2-f, Tilburg University, School of Economics and Management.
  46. Reijnierse, Hans & Maschler, Michael & Potters, Jos & Tijs, Stef, 1996. "Simple Flow Games," Games and Economic Behavior, Elsevier, vol. 16(2), pages 238-260, October.
  47. Tijs, S.H., 1992. "LP-games and combinatorial optimization games," Other publications TiSEM 8bacbc1f-5303-4467-93d9-5, Tilburg University, School of Economics and Management.
  48. S. H. Tijs & M. Koster & E. Molina & Y. Sprumont, 2002. "Sharing the cost of a network: core and core allocations," International Journal of Game Theory, Springer, vol. 30(4), pages 567-599.
  49. Suijs, J.P.M. & Borm, P.E.M. & Hamers, H.J.M. & Koster, M.A.L. & Quant, M., 2001. "Communications and Cooperation in Public Network Situations," Discussion Paper 2001-44, Tilburg University, Center for Economic Research.
  50. S. C. Littlechild & G. Owen, 1973. "A Simple Expression for the Shapley Value in a Special Case," Management Science, INFORMS, vol. 20(3), pages 370-372, November.
  51. Grahn, S., 2001. "Core and Bargaining Set of Shortest Path Games," Papers 2001:03, Uppsala - Working Paper Series.
  52. Tijs, S.H. & van Gellekom, J.R.G. & Potters, J.A.M. & Reijnierse, J.H. & Engel, M.C., 2000. "Characterization of the Owen set of linear production processes," Other publications TiSEM bdf0c618-e9f1-496a-b977-0, Tilburg University, School of Economics and Management.
  53. repec:spr:compst:v:52:y:2000:i:2:p:251-264 is not listed on IDEAS
  54. Meca-Martinez, A. & Timmer, J.B. & Garcia-Jurado, I. & Borm, P.E.M., 1999. "Inventory Games," Discussion Paper 1999-53, Tilburg University, Center for Economic Research.
  55. Hartman, Bruce C. & Dror, Moshe & Shaked, Moshe, 2000. "Cores of Inventory Centralization Games," Games and Economic Behavior, Elsevier, vol. 31(1), pages 26-49, April.
  56. Hamers, H.J.M. & Klijn, F. & Solymosi, T. & Tijs, S.H. & Pere Villar, J., 1999. "On the extreme points of the core of neighbour games and assignment games," Discussion Paper 1999-43, Tilburg University, Center for Economic Research.
  57. Jean Derks & Jeroen Kuipers, 1997. "On the Core of Routing Games," International Journal of Game Theory, Springer, vol. 26(2), pages 193-205.
  58. Reijnierse, J.H. & Maschler, M.B. & Potters, J.A.M. & Tijs, S.H., 1996. "Simple flow games," Other publications TiSEM 1627a9be-de9d-4905-b68a-1, Tilburg University, School of Economics and Management.
  59. Sprumont, Yves, 1990. "Population monotonic allocation schemes for cooperative games with transferable utility," Games and Economic Behavior, Elsevier, vol. 2(4), pages 378-394, December.
  60. Grahn, Sofia, 2001. "Core and Bargaining Set of Shortest Path Games," Working Paper Series 2001:3, Uppsala University, Department of Economics.
  61. Granot, D. & Hamers, H.J.M., 2000. "On the Equivalence between some Local and Global Chinese Postman and Traveling Salesman Graphs," Discussion Paper 2000-48, Tilburg University, Center for Economic Research.
  62. Stefano Moretti & Henk Norde & Kim Pham Do & Stef Tijs, 2002. "Connection problems in mountains and monotonic allocation schemes," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer, vol. 10(1), pages 83-99, June.
  63. Hamers, H.J.M. & Borm, P.E.M. & van den Leensel, A. & Tijs, S.H., 1999. "Cost allocation in the Chinese postman problem," Other publications TiSEM 5da2ea14-2fdf-4d1f-8b60-2, Tilburg University, School of Economics and Management.
  64. R. Branzei & E. Inarra & S. Tijs & J. M. Zarzuelo, 2005. "Cooperation by Asymmetric Agents in a Joint Project," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 7(4), pages 623-640, October.
  65. Curiel, Imma & Pederzoli, Giorgio & Tijs, Stef, 1989. "Sequencing games," European Journal of Operational Research, Elsevier, vol. 40(3), pages 344-351, June.
  66. van den Nouweland, Anne & Krabbenborg, Marc & Potters, Jos, 1992. "Flow-shops with a dominant machine," European Journal of Operational Research, Elsevier, vol. 62(1), pages 38-46, October.
  67. Tijs, S.H. & Parthasarathy, T. & Potters, J.A.M. & Rajendra Prasad, V., 1984. "Permutation games : Another class of totally balanced games," Other publications TiSEM a7edfa18-6224-4be3-b677-5, Tilburg University, School of Economics and Management.
  68. Timmer, J.B. & Tijs, S.H. & Llorca, N., 2000. "Games arising from infinite production situations," Other publications TiSEM 37ccd02a-35e7-4069-a2df-6, Tilburg University, School of Economics and Management.
  69. Suijs, J.P.M. & Hamers, H.J.M. & Tijs, S.H., 1997. "On the consistency of reward allocation rules in sequencing situations," Other publications TiSEM 72fc3d77-49bf-476f-a6e6-7, Tilburg University, School of Economics and Management.
  70. Timmer, J.B., 2001. "Cooperative behaviour, uncertainty and operations research," Other publications TiSEM 4a00d965-b7c4-4f43-8f76-5, Tilburg University, School of Economics and Management.
  71. Curiel, I. & Derks, J. & Tijs, S.H., 1989. "On balanced games and games with committee control," Other publications TiSEM 43993ad7-6225-435d-bfa4-b, Tilburg University, School of Economics and Management.
  72. Llorca, N. & Tijs, S.H. & Timmer, J.B., 1999. "Semi-Infinite Assignment Problems and Related Games," Discussion Paper 1999-74, Tilburg University, Center for Economic Research.
  73. O'Neill, Barry, 1982. "A problem of rights arbitration from the Talmud," Mathematical Social Sciences, Elsevier, vol. 2(4), pages 345-371, June.
  74. Curiel, I. & Pederzoli, G. & Tijs, S.H., 1988. "Reward allocations in production systems," Other publications TiSEM 9faea4df-638c-4f54-a61b-1, Tilburg University, School of Economics and Management.
  75. Hamers, Herbert & Suijs, Jeroen & Tijs, Stef & Borm, Peter, 1996. "The Split Core for Sequencing Games," Games and Economic Behavior, Elsevier, vol. 15(2), pages 165-176, August.
  76. S.C. Littlechild & G.F. Thompson, 1977. "Aircraft Landing Fees: A Game Theory Approach," Bell Journal of Economics, The RAND Corporation, vol. 8(1), pages 186-204, Spring.
  77. Nishizaki, Ichiro & Sakawa, Masatoshi, 2001. "On computational methods for solutions of multiobjective linear production programming games," European Journal of Operational Research, Elsevier, vol. 129(2), pages 386-413, March.
  78. Quint, Thomas, 1996. "On One-Sided versus Two-Sided Matching Games," Games and Economic Behavior, Elsevier, vol. 16(1), pages 124-134, September.
  79. Calleja, P. & Borm, P.E.M. & Hendrickx, R.L.P., 2001. "Multi-Issue Allocation Games," Discussion Paper 2001-30, Tilburg University, Center for Economic Research.
Full references (including those not matched with items on IDEAS)

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

When requesting a correction, please mention this item's handle: RePEc:spr:topjnl:v:9:y:2001:i:2:p:139-199. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)

or (Christopher F Baum)

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.

This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.