Home Itens selecionados Provedores de dados OAI Créditos Sobre Ajuda

			Busca avançada
	Provedor de dados AgEcon (1) Autor Dimitrov, Dinko (1) Sung, Shao Chin (1) Palavra-chave Additive Preferences (1) C63 (1) C70 (1) C71 (1) Coalition Formation (1) Computational Complexity (1) D02 (1) D70 (1) D71 (1) Hedonic Games (1) NP-complete (1) NP-hard (1) Research Methods/ Statistical Methods (1) Mais... Tipo do documento Working or Discussion Paper (1) Ano 2008 (1) País United States (1) Idioma Inglês (1)		Ordenar por:  Relevância Autor Título Ano Registros recuperados: 1 Primeira ... 1 ... Última Computational Complexity in Additive Hedonic Games AgEcon Sung, Shao Chin; Dimitrov, Dinko. 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 consideration, the existence problem of a stable coalition structure is NP-hard in the strong sense. Furthermore, the corresponding decision problems with respect to the existence of a Nash stable coalition structure and of an individually stable coalition structure turn out to be NP-complete in the strong sense. Tipo: Working or Discussion Paper Palavras-chave: Additive Preferences; Coalition Formation; Computational Complexity; Hedonic Games; NP-hard; NP-complete; Research Methods/ Statistical Methods; C63; C70; C71; D02; D70; D71. Ano: 2008 URL: http://purl.umn.edu/46655 Registros recuperados: 1 Primeira ... 1 ... Última

Empresa Brasileira de Pesquisa Agropecuária - Embrapa Todos os direitos reservados, conforme Lei n° 9.610 Política de Privacidade Área restrita		Embrapa Parque Estação Biológica - PqEB s/n° Brasília, DF - Brasil - CEP 70770-901 Fone: (61) 3448-4433 - Fax: (61) 3448-4890 / 3448-4891 SAC: https://www.embrapa.br/fale-conosco