Algorithms for core stability, core largeness, exactness, and extendability of flow games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4598 LNCS, Issue , 2007, Pages 439-447

  Fang, Qizhi ^a   Fleischer, Rudolf ^b   Li, Jian ^b   Sun, Xiaoxun ^c  

^a OCEAN UNIVERSITY OF CHINA   (China)

^b FUDAN UNIVERSITY   (China)

^c UNIVERSITY OF SOUTHERN QUEENSLAND   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER GRAPHICS; LINEAR PROGRAMMING;

FLOW GAMES; LINEAR TIME ALGORITHMS;

GAME THEORY;

EID: 37849019998     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73545-8_43     Document Type: Conference Paper

References (19)

1. 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)
2. Biswas, A.K., Parthasarathy, T., Potters, J.A.M., Voorneveld, M.: Large cores and exactness. Game and Economic Beheavior 28, 1-12 (1999)
3. Deng, X., Fang, Q., Sun, X.: Finding nucleolus of flow game. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'06), pp. 124-131. ACM Press, New York (2006)
4. Deng, X., Ibaraki, T., Nagamochi, H.: Algorithmic aspects of the core of combinatorial optimization games. Mathematics of Operations Research 24, 751-766 (1999)
5. Deng, X., Papadimitriou, C.H.: On the complexity of cooperative solution concepts. Mathematics of Operations Research 19, 257-266 (1994)
6. Duffin, R.: Topology of series-parallel networks. Journal of Mathematical Analysis and Applications 10, 303-318 (1965)
7. 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)
8. Jain, K., Vohra, R.V.: On stability of the core. Manuscript (2006), http://www.kellogg.northwestern.edu/facuity/vohra/ftp/newcore.pdf
9. Jakoby, A., Liśkiewicz, M., Reischuk, R.: Space efficient algorithms for directed series-parallel graphs. Journal of Algorithms 60(2), 85-114 (2006)
10. Kalai, E., Zemel, E.: Totally balanced games and games of flow. Mathematics of Operations Research 7, 476-478 (1982)
11. Kalai, E., Zemel, E.: Generalized network problems yielding totally balanced games. Operations Research 30, 998-1008 (1982)
12. Kikuta, K., Shapley, L.S.: Core stability in n-person games. Manuscript (1986)
13. Lucas, W.F.: A game with no solution. Bulletin of the American Mathematical Society 74, 237-239 (1968)
14. Sharkey, W. W.: Cooperative games with large cores. International Journal of Game Theory 11, 175-182 (1982)
15. Solymosi, T., Raghavan, T.E.S.: Assignment games with stable cores. International Journal of Game Theory 30, 177-185 (2001)
16. 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)
17. Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series-parallel digraphs. In: Proceedings of the 11th Annual ACM Symposium on Theory of Computing (STOC'79), pp. 1-12. ACM Press, New York (1979)
18. van Gellekom, J.R.G., Potters, J.A.M., Reijnierse, J.H.: Prosperity properties of TU-games. International Journal of Game Theory 28, 211-227 (1999)
19. von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behaviour. Princeton University Press, Princeton (1944)