Algorithms for core stability, core largeness, exactness, and extendability of flow games
From MaRDI portal
Publication:2266830
Recommendations
Cites work
- A game with no solution
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games
- Assignment games with stable core
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Cooperative games with large cores
- Core Stability of Flow Games
- Cores of convex games
- Finding nucleolus of flow game
- Generalized Network Problems Yielding Totally Balanced Games
- Graph-Theoretic Concepts in Computer Science
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 1796969 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- Large cores and exactness
- Network Flow and Testing Graph Connectivity
- On the Complexity of Cooperative Solution Concepts
- Prosperty properties of TU-games
- Solving the 2-disjoint paths problem in nearly linear time
- Space efficient algorithms for directed series–parallel graphs
- The Recognition of Series Parallel Digraphs
- Topology of series-parallel networks
- Totally Balanced Games and Games of Flow
Cited in
(8)- On computational complexity of membership test in flow games and linear production games
- Core stability in chain-component additive games
- The least-core of threshold network flow games
- On the core and f-nucleolus of flow games
- Core Stability of Flow Games
- Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Balancedness conditions for exact games
This page was built for publication: Algorithms for core stability, core largeness, exactness, and extendability of flow games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2266830)