An algorithm to compute the nucleolus of shortest path games

DOI10.1007/s00453-019-00574-9zbMath1442.91007OpenAlexW2936352478MaRDI QIDQ1999962

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

zbMATH Keywords

cooperative gamesnucleolusshortest path games

Mathematics Subject Classification ID

Cooperative games (91A12) Algorithmic game theory and complexity (91A68)

Related Items (1)

Arboricity games: the core and the nucleolus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the core and nucleolus of directed acyclic graph games
• On the nucleolus of shortest path games
• The nucleolus of balanced simple flow networks
• An algorithm for finding the nucleolus of assignment games
• On shortest path games
• 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.
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• Finding minimum cost to time ratio cycles with small integral transit times
• The Least-Core and Nucleolus of Path Cooperative Games
• Finding minimum-cost circulations by canceling negative cycles
• Generalized Network Problems Yielding Totally Balanced Games
• Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
• The Nucleolus of a Characteristic Function Game
• Matching Games: The Least Core and the Nucleolus
• Finding nucleolus of flow game

This page was built for publication: An algorithm to compute the nucleolus of shortest path games