Fang, Qizhi and Fleischer, Rudolf and Li, Jian and Sun, Xiaoxun (2010) Algorithms for core stability, core largeness, exactness, and extendability of flow games. Frontiers of Mathematics in China , 5 (1). pp. 47-63. ISSN 1673-3452
|HTML Citation||EndNote||Dublin Core||Reference Manager|
Full text not available from this archive.
Official URL: http://www.springerlink.com/content/444828m32402m82r/
Identification Number or DOI: doi: 10.1007/s11464-009-0048-y
We study core stability and some related properties of flow games defined on simple networks (all edge capacities are equal) from an algorithmic point of view. We first present a sufficient and necessary condition that can be tested efficiently for a simple flow game to have a stable core. We also prove the equivalence of the properties of core largeness, extendability, and exactness of simple flow games and provide an equivalent graph theoretic characterization which allows us to decide these properties in polynomial time.
|Item Type:||Article (Commonwealth Reporting Category C)|
|Additional Information:||Permanent restricted access to published version due to publisher copyright policy.|
|Uncontrolled Keywords:||flow network; series-parallel graph; imputation; cooperative game|
|Fields of Research (FOR2008):||08 Information and Computing Sciences > 0805 Distributed Computing > 080503 Networking and Communications|
08 Information and Computing Sciences > 0802 Computation Theory and Mathematics > 080299 Computation Theory and Mathematics not elsewhere classified
19 Studies in Creative Arts and Writing > 1902 Film, Television and Digital Media > 190202 Computer Gaming and Animation
|Socio-Economic Objective (SEO2008):||E Expanding Knowledge > 97 Expanding Knowledge > 970108 Expanding Knowledge in the Information and Computing Sciences|
|Deposited On:||02 Aug 2011 11:43|
|Last Modified:||19 Sep 2012 11:05|
Archive Staff Only: edit this record