Network strength games: the core and the nucleolus

DOI10.1007/S10107-018-1348-3zbMATH Open1458.91022OpenAlexW2899868365MaRDI QIDQ2297643FDOQ2297643

Authors: Mourad Baïou, Francisco Barahona 

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

Recommendations

• On the nucleolus of shortest path games
• Sharing rewards in cooperative connectivity games
• On the core and nucleolus of directed acyclic graph games
• On the maximum income spanning forest games
• SUFFICIENT CONDITIONS FOR NONEMPTY CORE OF MINIMUM COST FOREST GAMES

zbMATH Keywords

cooperative gamesnucleolusstrength of a networknetwork strength game

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43) Combinatorial games (91A46)

Cites Work

• The Nucleolus of a Characteristic Function Game
• An algorithm for finding the nucleolus of assignment games
• The kernel/nucleolus of a standard tree game
• Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
• The nucleolus of balanced simple flow networks
• 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
• Cooperative facility location games
• On the core and nucleolus of minimum cost spanning tree games
• Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
• Totally Balanced Games and Games of Flow
• On the complexity of testing membership in the core of min-cost spanning tree games
• On the Complexity of Cooperative Solution Concepts
• Packing algorithms for arborescences (and spanning trees) in capacitated graphs
• Algorithmic Aspects of the Core of Combinatorial Optimization Games
• Finding nucleolus of flow game
• Optimal attack and reinforcement of a network
• A faster algorithm for computing the strength of a network
• Matching Games: The Least Core and the Nucleolus
• Connectivity and edge-disjoint spanning trees
• Design of network topology in an adversarial environment
• Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem
• Packing Spanning Trees
• On the nucleolus of shortest path games
• Algorithmic Cooperative Game Theory

Cited In (2)

• Arboricity games: the core and the nucleolus
• The SD-prenucleolus for TU games

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)