On the nucleolus of shortest path games

DOI10.1007/978-3-319-66700-3_5zbMATH Open1403.91028OpenAlexW2747628745MaRDI QIDQ681844FDOQ681844

Authors: Mourad Baïou, Francisco Barahona 

Publication date: 13 February 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-66700-3_5

Recommendations

• An algorithm to compute the nucleolus of shortest path games
• On computing the nucleolus of a balanced connected game
• Shortest path games
• On shortest path games
• Cost allocation in shortest path games

zbMATH Keywords

cooperative gamesnucleolusshortest path games

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cooperative games (91A12) Games involving graphs (91A43)

Cited In (13)

• Network strength games: the core and the nucleolus
• An algorithm to compute the nucleolus of shortest path games
• A heuristic procedure for computing the nucleolus
• Path cooperative games
• The Shapley value for shortest path games: a non-graph-based approach
• Stable lexicographic rules for shortest path games
• On shortest path games
• Network disconnection games: a game theoretic approach to checkpoint evaluation in networks
• Shortest path games
• Cost allocation in shortest path games
• The nucleolus and inheritance of properties in communication situations
• Computing the nucleolus of weighted voting games in pseudo-polynomial time
• On the core and nucleolus of directed acyclic graph games

This page was built for publication: On the nucleolus of shortest path games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q681844)