Finding nucleolus of flow game

DOI10.1145/1109557.1109572MaRDI QIDQ5901122zbMATH OpenOpenAlexFDO

Authors Xiaotie Deng, Qizhi Fang, Xiaoxun Sun

Publication date 16 August 2010

Published in Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1109557.1109572

Mathematics Subject Classification ID

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

Cited in

(5)

• On the population monotonicity of independent set games
• Algorithms for core stability, core largeness, exactness, and extendability of flow games
• On the computational complexity of weighted voting games
• Arboricity games: the core and the nucleolus
• Finding nucleolus of flow game

This page was built for publication: Finding nucleolus of flow game

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