Narrow search
Showing 1 - 8 of 8
Cover Image
Computational Complexity in Additive Hedonic Games
Sung, Shao-Chin; Dimitrov, Dinko - 2008
We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive. Precisely, we prove that when either core stability or strict core stability is under...
Persistent link: https://ebvufind01.dmz1.zbw.eu/10010427536
Cover Image
Computational Complexity in Additive Hedonic Games
Sung, Shao Chin; Dimitrov, Dinko - 2009
We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive. Precisely, we prove that when either core stability or strict core stability is under...
Persistent link: https://ebvufind01.dmz1.zbw.eu/10014211874
Cover Image
Computational complexity in additive hedonic games
Sung, Shao Chin; Dimitrov, Dinko - 2008
We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive. Precisely, we prove that when either core stability or strict core stability is under...
Persistent link: https://ebvufind01.dmz1.zbw.eu/10003951586
Cover Image
List-based decision problems
Dimitrov, Dinko; Mukherjee, Saptarshi; Muto, Nozomu - 2013
Persistent link: https://ebvufind01.dmz1.zbw.eu/10009726181
Cover Image
Computational complexity in additive hedonic games
Sung, Shao Chin; Dimitrov, Dinko - In: European journal of operational research : EJOR 203 (2010) 3, pp. 635-639
Persistent link: https://ebvufind01.dmz1.zbw.eu/10003944218
Cover Image
"Divide-and-choose" in list-based decision problems
Dimitrov, Dinko; Mukherjee, Saptarshi; Muto, Nozomu - In: Theory and decision : an international journal for … 81 (2016) 1, pp. 17-31
Persistent link: https://ebvufind01.dmz1.zbw.eu/10011593923
Cover Image
Computational complexity in additive hedonic games
Dimitrov, Dinko; Sung, Shao Chin - 2008
We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive. Precisely, we prove that when either core stability or strict core stability is under...
Persistent link: https://ebvufind01.dmz1.zbw.eu/10008799165
Cover Image
The complexity of shelflisting
Yang, Yongjie; Dimitrov, Dinko - In: Theory and decision : an international journal for … 86 (2019) 1, pp. 123-141
Persistent link: https://ebvufind01.dmz1.zbw.eu/10012133337