Path cooperative games
From MaRDI portal
Publication:724748
DOI10.1007/s10878-018-0296-4zbMath1416.91025OpenAlexW2799695285MaRDI QIDQ724748
Xiaoming Sun, Bo Li, Qizhi Fang, Xiaohan Shan
Publication date: 26 July 2018
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-018-0296-4
Cites Work
- Unnamed Item
- Unnamed Item
- On the complexity of core, kernel, and bargaining set
- On the nucleolus of shortest path games
- The nucleolus of balanced simple flow networks
- Computing the least-core and nucleolus for threshold cardinality matching games
- An algorithm for finding the nucleolus of assignment games
- On the complexity of testing membership in the core of min-cost spanning tree games
- On computational complexity of membership test in flow games and linear production games
- Computing the nucleolus of min-cost spanning tree games is NP-hard.
- Simple flow games
- The Least-Core of Threshold Network Flow Games
- The Least-Core and Nucleolus of Path Cooperative Games
- Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
- Generalized Network Problems Yielding Totally Balanced Games
- On the Complexity of Cooperative Solution Concepts
- Two-Person Zero-Sum Games for Network Interdiction
- Quasi-Cores in a Monetary Economy with Nonconvex Preferences
- The Nucleolus of a Characteristic Function Game
- Matching Games: The Least Core and the Nucleolus
- Finding nucleolus of flow game
