Finding nucleolus of flow game
From MaRDI portal
Publication:5896983
DOI10.1007/s10878-008-9138-0zbMath1188.91024OpenAlexW3137934641MaRDI QIDQ5896983
Xiaoxun Sun, Qizhi Fang, Xiaotie Deng
Publication date: 2 September 2009
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-008-9138-0
Analysis of algorithms and problem complexity (68Q25) Cooperative games (91A12) Games involving graphs (91A43) (n)-person games, (n>2) (91A06)
Related Items
Finding the nucleoli of large cooperative games ⋮ The Least-Core and Nucleolus of Path Cooperative Games ⋮ On the complexity of nucleolus computation for bipartite \(b\)-matching games ⋮ Computing the least-core and nucleolus for threshold cardinality matching games ⋮ Characterization sets for the nucleolus in balanced games ⋮ A game theoretical approach to emergency logistics planning in natural disasters ⋮ On the complexity of core, kernel, and bargaining set ⋮ The least square B-nucleolus for fuzzy cooperative games ⋮ Finding and verifying the nucleolus of cooperative games ⋮ On the core and nucleolus of directed acyclic graph games ⋮ An algorithm to compute the nucleolus of shortest path games ⋮ The nucleolus of arborescence games in directed acyclic graphs ⋮ Path cooperative games ⋮ Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value ⋮ Computing the nucleolus of weighted cooperative matching games in polynomial time ⋮ Network strength games: the core and the nucleolus ⋮ Answers set programs for non-transferable utility games: expressiveness, complexity and applications ⋮ Network disconnection games: a game theoretic approach to checkpoint evaluation in networks ⋮ The Complexity of the Nucleolus in Compact Games ⋮ A heuristic procedure for computing the nucleolus ⋮ Computing the nucleolus of weighted voting games in pseudo-polynomial time
Cites Work
- Unnamed Item
- Unnamed Item
- The nucleolus of balanced simple flow networks
- Game theoretic analysis of a bankruptcy problem from the Talmud
- Geometric algorithms and combinatorial optimization.
- An algorithm for finding the nucleolus of assignment games
- On the computation of the nucleolus of a cooperative game
- On computational complexity of membership test in flow games and linear production games
- Computing the nucleolus of some combinatorially-structured games.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- The kernel/nucleolus of a standard tree game
- Characterization sets for the nucleolus
- Computing the nucleolus of min-cost spanning tree games is NP-hard.
- The assignment game. I: The core
- Strongly essential coalitions and the nucleolus of peer group games
- Generalized Network Problems Yielding Totally Balanced Games
- Totally Balanced Games and Games of Flow
- On the core of linear production games
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
- On the Complexity of Cooperative Solution Concepts
- Cooperative facility location games
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Paths, Trees, and Flowers
- The Nucleolus of a Characteristic Function Game
- Matching Games: The Least Core and the Nucleolus
- Finding nucleolus of flow game
This page was built for publication: Finding nucleolus of flow game
