Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Internet and Network Economics

WINE 2008: Internet and Network Economics pp 454–464Cite as

Restricted Core Stability of Flow Games

  • Conference paper

  • 2875 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5385))

Abstract

In this paper, we introduce a kind of restricted core stability for flow games, which is a generalization of the core stability of simple flow games. We first give a characterization on the restricted core, and then propose a sufficient and necessary condition on the restricted core stability for flow games associated with general networks. This condition yields that testing the restricted core stability can be done in polynomial time.

This work is supported by NSFC (No.10571117, 10671108 and 10771200) and NCET.

This is a preview of subscription content, 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   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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice Hall, Inc., Englewood Cliffs (1993)

    MATH  Google Scholar 

  2. Bietenhader, T., Okamoto, Y.: Core Stability of Minimum Coloring Games. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 389–401. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Deng, X., Fang, Q., Sun, X.: Finding nucleolus of flow games. In: SODA 2006, pp. 124–131 (2006)

    Google Scholar 

  4. Deng, X., Ibaraki, T., Nagamochi, H.: Algorithmic aspects of the core of combinatorial ptimization games. Mathematics of Operations Research 24, 751–766 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  5. Deng, X., Papadimitriou, C.H.: On The Complexity of Cooperative Solution Concepts. Mathematics of Operations Research 19, 257–266 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  6. Fang, Q., Zhu, S., Cai, M., Deng, X.: Membership for core of LP games and other games. In: Wang, J. (ed.) COCOON 2001. LNCS, vol. 2108, pp. 247–256. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Kalai, E., Zernel, E.: Totally balanced games and games of flow. Mathematics of Operations Research 7, 476–478 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kalai, E., Zernel, E.: Generalized network problems yielding totally balanced games. Operations Research 30, 498–1008 (1982)

    Article  Google Scholar 

  9. Potters, J., Reijnierse, H., Biswas, A.: The nucleolus of balanced simple flow networks. Games Econom. Behav. 54, 205–225 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  10. Shapley, L.S.: Cores and convex games. International Journal of Game Theory 1, 11–26 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  11. Solymosi, T., Raghavan, T.E.S.: Assignment Games with Stable Cores. International Journal of Game Theory 30, 177–185 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  12. Sun, X., Fang, Q.: Core stability of flow games. In: Akiyama, J., Chen, W.Y.C., Kano, M., Li, X., Yu, Q. (eds.) CJCDGCGT 2005. LNCS, vol. 4381, pp. 189–199. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  13. von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behaviour. Princeton University Press, Princeton (1944)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Academy of Mathematics and Systems Science, Chinese Academy of Science, Beijing, 100080, China

    Mao-cheng Cai

  2. Department of Mathematics, Ocean University of China, Qingdao, 266071, China

    Qizhi Fang

Authors
  1. Mao-cheng Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qizhi Fang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Division, University of California at Berkeley, Berkeley, CA, USA

    Christos Papadimitriou

  2. Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong

    Shuzhong Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cai, Mc., Fang, Q. (2008). Restricted Core Stability of Flow Games . In: Papadimitriou, C., Zhang, S. (eds) Internet and Network Economics. WINE 2008. Lecture Notes in Computer Science, vol 5385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92185-1_51

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92185-1_51

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92184-4

  • Online ISBN: 978-3-540-92185-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation