.png){kind=icon}
返回
Computing desirable partitions in additively separable hedonic games
.png){kind=icon}
OA
AI
DOI：10.1016/j.artint.2012.09.006.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
An important aspect in systems of multiple autonomous agents is the exploitation of synergies via coalition formation. Additively separable hedonic games are a fundamental class of coalition formation games in which each player has a value for any other player and the value of a coalition to a particular player is simply the sum of the values he assigns to the members of his coalition. In this paper, we consider a number of solution concepts from cooperative game theory, welfare theory, and social choice theory as criteria for desirable partitions in hedonic games. We then conduct a detailed computational analysis of computing, checking the existence of, and verifying stable, fair, optimal, and popular partitions for additively separable hedonic games. (C) 2012 Elsevier B.V. All rights reserved.
Keyword:
Game theory
Coalition formation
Hedonic games
Computational complexity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
引用论文
The natural absence of RPA1N domain did not impair Leishmania amazonensis RPA-1 participation in DNA damage response and telomere protection.png)
ParasitologyOAAI
ParasitologyIF0
OAAI分享收藏
On a Special Apparatus for the Measurement at Various Temperatures of the Thomson Effect in Wires
PREAI
分享收藏Isolated DC-DC Converter for Thermoelectric Energy Harvesting Based on a Piezoelectric Transformer
PREAI
分享收藏分享收藏
查看更多内容