Recommendations
Cites work
- A course in game theory.
- An algorithm for finding the nucleolus of assignment games
- Computing the least-core and nucleolus for threshold cardinality matching games
- Computing the nucleolus of min-cost spanning tree games is NP-hard.
- Computing the nucleolus of weighted voting games
- Finding nucleolus of flow game
- Generalized Network Problems Yielding Totally Balanced Games
- Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
- Matching Games: The Least Core and the Nucleolus
- On computational complexity of membership test in flow games and linear production games
- On the Complexity of Cooperative Solution Concepts
- On the complexity of core, kernel, and bargaining set
- On the complexity of testing membership in the core of min-cost spanning tree games
- On the nucleolus of shortest path games
- Quasi-Cores in a Monetary Economy with Nonconvex Preferences
- Simple flow games
- The Least-Core and Nucleolus of Path Cooperative Games
- The Nucleolus of a Characteristic Function Game
- The least-core of threshold network flow games
- The nucleolus of balanced simple flow networks
- Two-Person Zero-Sum Games for Network Interdiction
Cited in
(3)
This page was built for publication: Path cooperative games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724748)
