Nash Stability in Additively Separable Hedonic Games and Community Structures

Martin Olsen

doi:10.1007/s00224-009-9176-8

Nash Stability in Additively Separable Hedonic Games and Community Structures

Authors:

Olsen, Martin
Close
0000-0002-2740-545X
unknown

DOI:

10.1007/s00224-009-9176-8

Abstract:

We prove that the problem of deciding whether a Nash stable partition exists in an Additively Separable Hedonic Game is NP-complete. We also show that the problem of deciding whether a non trivial Nash stable partition exists in an Additively Separable Hedonic Game with non-negative and symmetric preferences is NP-complete. We motivate our study of the computational complexity by linking Nash stable partitions in Additively Separable Hedonic Games to community structures in networks. Our results formally justify that computing community structures in general is hard.

Type:

Journal article

Language:

English

Published in:

Theory of Computing Systems, 2009, Vol 45, Issue 4, p. 917-925

Main Research Area:

Science/technology

Publication Status:

Published

Review type:

Peer Review

Submission year:

2009

Scientific Level:

Scientific

ID:

1108691

Nash Stability in Additively Separable Hedonic Games and Community Structures

Full text access

On-site access

At institution

Example	Finds records
water{}	containing the word "water".
water supplies"{}"	containing the phrase "water supplies".
author:"Doe, John"author:"{}"	containing the phrase "Doe, John" in the author field.
title:IEEEtitle:{}	containing the word "IEEE" in the title field.
bech{}	containing the word "bech".
marie bech"{}"	containing the phrase "marie bech".
orcid:0000-0002-5429-5292orcid:{}	Having a particular ORCID
Need more help?	Advanced search tutorial