Computing desirable partitions in additively separable hedonic games

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 parti...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Artificial intelligence Ročník 195; s. 316 - 334
Hlavní autori: Aziz, Haris, Brandt, Felix, Seedig, Hans Georg
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Oxford Elsevier B.V 01.02.2013
Elsevier
Predmet:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Coalition formation
Computational complexity
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Decision theory. Utility theory
Exact sciences and technology
Game theory
Hedonic games
Operational research and scientific management
Operational research. Management science
Software
Theoretical computing
Coalition formation
Game theory
Computational complexity
Hedonic games
Autonomous system
Partition
Separability
Wellfare economy
Partition method
Synergism
N person game
Social decision
Multiagent system
Coalition
Cooperative game
ISSN:0004-3702, 1872-7921
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
ISSN:0004-3702
1872-7921
DOI:10.1016/j.artint.2012.09.006