Network strength games: the core and the nucleolus
From MaRDI portal
Publication:2297643
DOI10.1007/s10107-018-1348-3zbMath1458.91022OpenAlexW2899868365MaRDI QIDQ2297643
Francisco Barahona, Mourad Baïou
Publication date: 20 February 2020
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-018-1348-3
Related Items (1)
Cites Work
- On the nucleolus of shortest path games
- The nucleolus of balanced simple flow networks
- Packing algorithms for arborescences (and spanning trees) in capacitated graphs
- A faster algorithm for computing the strength of a network
- An algorithm for finding the nucleolus of assignment games
- On the complexity of testing membership in the core of min-cost spanning tree games
- Connectivity and edge-disjoint spanning trees
- The kernel/nucleolus of a standard tree game
- Design of Network Topology in an Adversarial Environment
- On some approximately balanced combinatorial cooperative games
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- On the core and nucleolus of minimum cost spanning tree games
- Algorithmic Cooperative Game Theory
- Optimal attack and reinforcement of a network
- Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
- Totally Balanced Games and Games of Flow
- 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
- On the Complexity of Cooperative Solution Concepts
- Cooperative facility location games
- Packing Spanning Trees
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- 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: Network strength games: the core and the nucleolus
