Skip to main content

Gale's feasibility theorem on network flows and a bargaining set for cooperative TU games

  • Contributed Papers
  • Conference paper
  • First Online:
System Modelling and Optimization

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 197))

  • 1309 Accesses

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Aumann, R. J. and Dreze, J., (1974), Cooperative games with coalition structures, Int. Journal of Game Theory, Vol. 3, 4, 217–237.

    Article  MATH  MathSciNet  Google Scholar 

  2. Aumann, R. J. and Maschler, M., (1964), The bargaining set for cooperative games, in Advances in Game Theory, M. Drescher, L. S. Shapley, A. W. Tucker, eds., Annals of Math. Studies, No. 52, 443–476.

    Google Scholar 

  3. Dragan, I., (1988), The compensatory bargaining set of a cooperative n-person game with side payments, Univ. Texas at Arlington, TR #256.

    Google Scholar 

  4. Dragan, I., (1988), An existence theorem for the modified bargaining set of a cooperative n-person convex game, Libertas Math., 8, 55–64.

    MATH  MathSciNet  Google Scholar 

  5. Dragan, I., (1985), A combinatorial approach to the theory of the bargaining sets, Libertas Math., 5, 133–150.

    MATH  MathSciNet  Google Scholar 

  6. Ford, L. R. and Fulkerson, D. R., (1962), Flows in networks, Princeton Univ. Press.

    Google Scholar 

  7. Gale, D., (1957), A theorem on flows in networks, Pacific J. Math., Vol. 7, 1073–1082.

    Article  MATH  MathSciNet  Google Scholar 

  8. Maschler, M., (1992), The bargaining set, kernel and nucleolus, in Handbook of Game Theory, Vol. I, R. J. Aumann, S. Hart, eds., Chapter 18, 591–667.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jacques Henry Jean-Pierre Yvon

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag

About this paper

Cite this paper

Dragan, I. (1994). Gale's feasibility theorem on network flows and a bargaining set for cooperative TU games. In: Henry, J., Yvon, JP. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035477

Download citation

  • DOI: https://doi.org/10.1007/BFb0035477

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19893-2

  • Online ISBN: 978-3-540-39337-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics