The Least-Core and Nucleolus of Path Cooperative Games

DOI10.1007/978-3-319-21398-9_6zbMath1479.91024arXiv1503.04575OpenAlexW2162828214MaRDI QIDQ3196373

Xiaoming Sun, Qizhi Fang, Bo Li, Xiaohan Shan

Publication date: 29 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.04575

zbMATH Keywords

cooperative gamescorenucleolusflow games

Mathematics Subject Classification ID

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

Related Items (3)

An algorithm to compute the nucleolus of shortest path games ⋮ Path cooperative games ⋮ A heuristic procedure for computing the nucleolus

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of core, kernel, and bargaining set
• The nucleolus of balanced simple flow networks
• An algorithm for finding the nucleolus of assignment games
• On the complexity of testing membership in the core of min-cost spanning tree games
• On computational complexity of membership test in flow games and linear production games
• Computing the nucleolus of min-cost spanning tree games is NP-hard.
• On the computational complexity of weighted voting games
• Simple flow games
• Computational Aspects of Cooperative Game Theory
• The Least-Core of Threshold Network Flow Games
• Generalized Network Problems Yielding Totally Balanced Games
• On the Complexity of Cooperative Solution Concepts
• Two-Person Zero-Sum Games for Network Interdiction
• 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: The Least-Core and Nucleolus of Path Cooperative Games