The Least-Core of Threshold Network Flow Games
From MaRDI portal
Publication:3088027
DOI10.1007/978-3-642-22993-0_7zbMath1343.91011OpenAlexW1817752138MaRDI QIDQ3088027
Publication date: 17 August 2011
Published in: Mathematical Foundations of Computer Science 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22993-0_7
Cooperative games (91A12) Games involving graphs (91A43) Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
The Least-Core and Nucleolus of Path Cooperative Games ⋮ Proof systems and transformation games ⋮ On \(\alpha\)-roughly weighted games ⋮ Efficient algorithms for game-theoretic betweenness centrality ⋮ Computing cooperative solution concepts in coalitional skill games ⋮ Path cooperative games ⋮ Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value
This page was built for publication: The Least-Core of Threshold Network Flow Games