On the nucleolus of shortest path games
From MaRDI portal
Publication:681844
DOI10.1007/978-3-319-66700-3_5zbMath1403.91028OpenAlexW2747628745MaRDI QIDQ681844
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
Analysis of algorithms and problem complexity (68Q25) Cooperative games (91A12) Games involving graphs (91A43)
Related Items (5)
An algorithm to compute the nucleolus of shortest path games ⋮ Path cooperative games ⋮ Network strength games: the core and the nucleolus ⋮ A heuristic procedure for computing the nucleolus ⋮ Computing the nucleolus of weighted voting games in pseudo-polynomial time
This page was built for publication: On the nucleolus of shortest path games