Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games

DOI10.1007/978-3-540-73545-8_43zbMATH Open1213.91042OpenAlexW1591265472MaRDI QIDQ3608868FDOQ3608868

Rudolf Fleischer, Xiaoxun Sun, Jian Li, Qizhi Fang

Publication date: 6 March 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-73545-8_43

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Cooperative games (91A12) Games involving graphs (91A43)

Cited In (4)

• Title not available (Why is that?)
• Algorithms for core stability, core largeness, exactness, and extendability of flow games
• On core stability, vital coalitions, and extendability
• On computational complexity of membership test in flow games and linear production games

   Recommendations

• Algorithms for core stability, core largeness, exactness, and extendability of flow games 👍 👎
• Core stability of vertex cover games 👍 👎
• Core Stability of Flow Games 👍 👎
• The Cost of Stability in Network Flow Games 👍 👎
• On the Core and f-Nucleolus of Flow Games 👍 👎

This page was built for publication: Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games

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