An algorithm to compute the nucleolus of shortest path games
From MaRDI portal
Publication:1999962
DOI10.1007/S00453-019-00574-9zbMATH Open1442.91007OpenAlexW2936352478MaRDI QIDQ1999962FDOQ1999962
Authors: Mourad Baïou, Francisco Barahona 
Publication date: 27 June 2019
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-019-00574-9
Recommendations
- On the nucleolus of shortest path games
- The Least-Core and Nucleolus of Path Cooperative Games
- Shortest path games
- Path cooperative games
- The minimum cost shortest-path tree game
- On shortest path games
- On computing the nucleolus of a balanced connected game
- Game Theoretic Approach to Multi-Agent Transportation Problems on Network
- On Some Network Flow Games
- scientific article; zbMATH DE number 1187071
Cites Work
- Network flows. Theory, algorithms, and applications.
- The Nucleolus of a Characteristic Function Game
- Title not available (Why is that?)
- An algorithm for finding the nucleolus of assignment games
- Title not available (Why is that?)
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
- The nucleolus of balanced simple flow networks
- Generalized Network Problems Yielding Totally Balanced Games
- Finding minimum-cost circulations by canceling negative cycles
- On shortest path games
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Computing the nucleolus of weighted voting games
- Finding nucleolus of flow game
- Matching Games: The Least Core and the Nucleolus
- Characterization sets for the nucleolus in balanced games
- Characterization sets for the nucleolus
- Computing the nucleolus of min-cost spanning tree games is NP-hard.
- On the core and nucleolus of directed acyclic graph games
- Title not available (Why is that?)
- On the nucleolus of shortest path games
- The Least-Core and Nucleolus of Path Cooperative Games
- Finding minimum cost to time ratio cycles with small integral transit times
Cited In (7)
- Arboricity games: the core and the nucleolus
- Path cooperative games
- Allocating the cost of congestion with the nucleolus
- Network disconnection games: a game theoretic approach to checkpoint evaluation in networks
- Shortest path games
- Cost allocation in shortest path games
- On the nucleolus of shortest path games
This page was built for publication: An algorithm to compute 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 Q1999962)
