Network strength games: the core and the nucleolus

DOI10.1007/S10107-018-1348-3MaRDI QIDQ2297643zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

cooperative gamesnucleolusstrength of a networknetwork strength game

Mathematics Subject Classification ID

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

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

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)

• Sharing rewards in cooperative connectivity games
• Arboricity games: the core and the nucleolus
• The SD-prenucleolus for TU games
• Network disconnection games: a game theoretic approach to checkpoint evaluation in networks
• On the maximum income spanning forest 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)