Network strength games: the core and the nucleolus
From MaRDI portal
(Redirected from Publication:2297643)
Recommendations
Cites work
- A faster algorithm for computing the strength of a network
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Algorithmic Cooperative Game Theory
- An algorithm for finding the nucleolus of assignment games
- Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
- Connectivity and edge-disjoint spanning trees
- Cooperative facility location games
- Design of network topology in an adversarial environment
- Edge-Disjoint Spanning Trees of Finite Graphs
- Finding nucleolus of flow game
- Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
- Matching Games: The Least Core and the Nucleolus
- On some approximately balanced combinatorial cooperative games
- On the Complexity of Cooperative Solution Concepts
- On the Problem of Decomposing a Graph into n Connected Factors
- On the complexity of testing membership in the core of min-cost spanning tree games
- On the core and nucleolus of minimum cost spanning tree games
- On the nucleolus of shortest path games
- Optimal attack and reinforcement of a network
- Packing Spanning Trees
- Packing algorithms for arborescences (and spanning trees) in capacitated graphs
- The Nucleolus of a Characteristic Function Game
- The kernel/nucleolus of a standard tree game
- The nucleolus of balanced simple flow networks
- Totally Balanced Games and Games of Flow
Cited in
(5)
This page was built for publication: Network strength games: the core and the nucleolus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2297643)