Skip to main content
SpringerLink
Log in

Combinatorial Optimization Games

CRPM

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

See also

References

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Deng X, Ibaraki T, Nagamochi H (1999) Algorithmic aspects of the core of combinatorial optimization games. Math Oper Res 24(3):751–766

    MATH  MathSciNet  Google Scholar 

  2. Deng X, Papadimitriou C (1994) On the complexity of cooperative game solution concepts. Math Oper Res 19(2):257–266

    MATH  MathSciNet  Google Scholar 

  3. Edmonds J (1965) Paths, tree, and flowers. Canad J Math 17:449–469

    MATH  MathSciNet  Google Scholar 

  4. Faigle U, Fekete S, Hochstättler W, Kern W (1997) On the complexity of testing membership in the core of min-cost spanning tree games. Internat J Game Theory 26:361–366

    MATH  MathSciNet  Google Scholar 

  5. Faigle U, Kern W (1995) Partition games and the core of hierarchically convex cost games. Memorandum Fac Toegepaste Wiskunde Univ Twente 1269, no. June

    Google Scholar 

  6. Granot D (1986) A generalized linear production model: A unified model. Math Program 34:212–222

    Article  MATH  MathSciNet  Google Scholar 

  7. Megiddo N (1978) Computational complexity and the game theory approach to cost allocation for a tree. Math Oper Res 3:189–196

    MATH  MathSciNet  Google Scholar 

  8. Owen G (1975) On the core of linear production games. Math Program 9:358–370

    Article  MATH  MathSciNet  Google Scholar 

  9. Schrijver A (1986) Theory of linear and integer programming. Wiley, New York

    MATH  Google Scholar 

  10. Shapley LS (1967) On balanced sets and cores. Naval Res Logist Quart 14:453–460

    Article  Google Scholar 

  11. Shapley LS, Shubik M (1972) The assignment game. Internat J Game Theory 1:111–130

    Article  MathSciNet  Google Scholar 

  12. Shubik M (1981) Game theory models and methods in political economy. In: Arrow KJ, Intriligator MD (eds) Handbook Math. Economics, vol 1. North Holland, Amsterdam, pp 285–330

    Google Scholar 

  13. Simon H (1972) Theories of bounded rationality. In: Radner R (ed) Decision and Organization. North Holland, Amsterdam

    Google Scholar 

  14. Tamir A (1981) On the core of cost allocation games defined on location problems. Preprints, Second Internat. Conf. Locational Decisions (ISOLDE 81) (Skodsborg, Denmark), pp 387–402

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. City University Hong Kong, Kowloon, China

    Xiaotie Deng

Authors
  1. Xiaotie Deng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Deng, X. (2008). Combinatorial Optimization Games . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_70

Download citation

Publish with us

Policies and ethics

Search

Navigation