Algorithms for core stability, core largeness, exactness, and extendability of flow games
From MaRDI portal
Publication:2266830
DOI10.1007/s11464-009-0048-yzbMath1185.91034MaRDI QIDQ2266830
Qizhi Fang, Rudolf Fleischer, Xiaoxun Sun, Jian Li
Publication date: 26 February 2010
Published in: Frontiers of Mathematics in China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11464-009-0048-y
91A12: Cooperative games
91A46: Combinatorial games
05C57: Games on graphs (graph-theoretic aspects)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cooperative games with large cores
- Prosperty properties of TU-games
- Large cores and exactness
- Assignment games with stable core
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Topology of series-parallel networks
- Solving the 2-disjoint paths problem in nearly linear time
- Cores of convex games
- Core Stability of Flow Games
- Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games
- The Recognition of Series Parallel Digraphs
- Generalized Network Problems Yielding Totally Balanced Games
- Totally Balanced Games and Games of Flow
- Network Flow and Testing Graph Connectivity
- On the Complexity of Cooperative Solution Concepts
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Space efficient algorithms for directed series–parallel graphs
- A game with no solution
- Graph-Theoretic Concepts in Computer Science
- Finding nucleolus of flow game
