Skip to main content

On the Reduced Game of Some Linear Production Games

  • Chapter
Essays in Game Theory

Abstract

In view of the importance of reduced games in cooperative game theory, it is interesting to find out whether they have any meaning in applications. Accordingly we investigate in this paper the Davis-Maschler reduced game of some linear production games. We introduce the extended linear production game model, which generalizes Owen’s linear production game model. We show that the Davis-Maschler reduced game of the extended linear production game, calculated at a core point, is a game of the same type, and we provide some sufficient conditions for the nonemptiness of the core of this game. We further investigate the (Davis-Maschler) reduced game of some network games. In particular, we prove that the reduced game of a simple network game, at a core point, is a simple network game and that the core of the reduced game of a simple network game, for any coalition and a core vector, coincides with the set of dual optimal solutions to an associated linear programming problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. J. Aumann and J. H. Drèze, “Cooperative games with coalition structures,” International Journal of Game Theory 3 (1974) 217–237.

    Article  MathSciNet  MATH  Google Scholar 

  2. R. J. Aumann and M. Maschler, “Game-theoretic analysis of a bankruptcy problem from the Talmud,” Journal of Economic Theory 36 (1985) 195–213.

    Article  MathSciNet  MATH  Google Scholar 

  3. C. Bird, “On cost allocation for a spanning tree: A game theory approach,” Networks 6 (1976) 335–350.

    Article  MathSciNet  MATH  Google Scholar 

  4. M. Davis and M. Maschler, “The kernel of a cooperative game,” Naval Research Logistics Quarterly 12 (1965) 223–259.

    Article  MathSciNet  MATH  Google Scholar 

  5. P. Dubey and L. S. Shapley, “Totally balanced games arising from controlled programming problems,” Mathematical Programming 29 (1984) 245–267.

    Article  MathSciNet  MATH  Google Scholar 

  6. D. Granot and F. Granot, “On some network flow games,” Mathematics of Operations Research 17 (1992) 792–841.

    Article  MathSciNet  MATH  Google Scholar 

  7. D. Granot and G. Huberman, “Minimum cost spanning tree games,” Mathematical Programming 21 (1981) 1–18.

    Article  MathSciNet  MATH  Google Scholar 

  8. D. Granot and G. Huberman, “On the core and nucleolus of minimum cost spanning tree games,” Mathematical Programming 29 (1984) 323–348.

    Article  MathSciNet  MATH  Google Scholar 

  9. D. Granot and M. Maschler, “On some spanning network games,” Mimeograph, Faculty of Commerce and Business Administration, U.B.C., 1991.

    Google Scholar 

  10. E. Kalai and E. Zemel, “Totally balanced games and games of flow,” Mathematics of Operations Research 7 (1982) 476–478.

    Article  MathSciNet  MATH  Google Scholar 

  11. E. Kalai and E. Zemel, “Generalized network problems yielding totally balanced games,” Operations Research 30 (1982) 998–1008.

    Article  MATH  Google Scholar 

  12. S. C. Littlechild, “A simple expression for the nucleolus in a special case,” International Journal of Game Theory 3 (1974) 21–29.

    Article  MathSciNet  MATH  Google Scholar 

  13. M. Maschler and B. Peleg, “The structure of the kernel of a cooperative game,” SIAM Journal of Applied Mathematics 15 (1967) 569–604.

    Article  MathSciNet  MATH  Google Scholar 

  14. M. Maschler, B. Peleg, and L. S. Shapley, “The kernel and bargaining set for convex games,” International Journal of Game Theory 1 (1972) 73–93.

    Article  MathSciNet  Google Scholar 

  15. N. Megiddo, “Computational complexity and the game theory approach to cost allocation for a tree,” Mathematics of Operations Research 3 (1978) 189–196.

    Article  MathSciNet  MATH  Google Scholar 

  16. N. Megiddo, “Cost allocation for Steiner trees,” Networks 8 (1978) 1–6.

    Article  MathSciNet  MATH  Google Scholar 

  17. G. Owen, “On the core of linear production games,” Mathematical Programming 9 (1975) 358–370.

    Article  MathSciNet  MATH  Google Scholar 

  18. G. Owen, “The assignment game: The reduced game,” Mimeograph.

    Google Scholar 

  19. B. Peleg, “On the reduced game property and its converse,” International Journal of Game Theory 15 (1986) 187–200.

    Article  MathSciNet  MATH  Google Scholar 

  20. A. I. Sobolev, “The characterization of optimality principles in cooperative games by functional equations,” Mathematical Methods in the Social Sciences 6 (1975) 150–165 (in Russian).

    Google Scholar 

  21. É. Tardos, “A strongly polynomial minimum cost circulation algorithm,” Combinatorica 5 (1985) 247–255.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag New York, Inc.

About this chapter

Cite this chapter

Granot, D. (1994). On the Reduced Game of Some Linear Production Games. In: Megiddo, N. (eds) Essays in Game Theory. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2648-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-2648-2_7

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-7621-0

  • Online ISBN: 978-1-4612-2648-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics