التفاصيل البيبلوغرافية
| العنوان: |
Nash Stability in Additively Separable Hedonic Games and Community Structures. |
| المؤلفون: |
Olsen, Martin |
| المصدر: |
Theory of Computing Systems; Nov2009, Vol. 45 Issue 4, p917-925, 9p, 2 Diagrams |
| مصطلحات موضوعية: |
STABILITY (Mechanics), SYMMETRIC functions, HEDONIC damages, COMMUNITY organization, PARTITION of unity method, SEPARABLE algebras |
| مستخلص: |
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. [ABSTRACT FROM AUTHOR] |
|
Copyright of Theory of Computing Systems is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| قاعدة البيانات: |
Complementary Index |
Full Text Finder