The least-core of threshold network flow games

DOI10.1007/978-3-642-22993-0_7MaRDI QIDQ3088027zbMATH OpenOpenAlexFDO

Authors Yoram Bachrach

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Deterministic network models in operations research (90B10) Cooperative games (91A12) Games involving graphs (91A43)

Recommendations

• The Cost of Stability in Network Flow Games
• The Least-Core and Nucleolus of Path Cooperative Games
• On Some Network Flow Games
• Core Stability of Flow Games
• Algorithms for core stability, core largeness, exactness, and extendability of flow games

Cited in

(9)

• Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value
• The Cost of Stability in Network Flow Games
• The Least-Core and Nucleolus of Path Cooperative Games
• Proof systems and transformation games
• On -roughly weighted games
• Computing cooperative solution concepts in coalitional skill games
• Flow games
• Path cooperative games
• Efficient algorithms for game-theoretic betweenness centrality

This page was built for publication: The least-core of threshold network flow games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3088027)