Testing stability properties in graphical hedonic games

Author:

Fichtenberger HendrikORCID,Rey AnjaORCID

Abstract

AbstractIn hedonic games, players form coalitions based on individual preferences over the group of players they could belong to. Several concepts to describe the stability of coalition structures in a game have been proposed and analysed in the literature. However, prior research focuses on algorithms with time complexity that is at least linear in the input size. In the light of very large games that arise from, e.g., social networks and advertising, we initiate the study of sublinear time property testing algorithms for existence and verification problems under several notions of coalition stability in a model of hedonic games represented by graphs with bounded degree. In graph property testing, one shall decide whether a given input has a property (e.g., a game admits a stable coalition structure) or is far from it, i.e., one has to modify at least an $$\epsilon$$ ϵ -fraction of the input (e.g., the game’s preferences) to make it have the property. In particular, we consider verification of perfection, individual rationality, Nash stability, (contractual) individual stability, and core stability. While there is always a Nash-stable coalition structure (which also implies individually stable coalitions), we show that the existence of a perfect coalition structure is not tautological but can be tested. All our testers have one-sided error and time complexity that is independent of the input size.

Funder

Universität zu Köln

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence

Reference39 articles.

1. Alon, N., Fischer, E., Newman, I., & Shapira, A. (2009). A combinatorial characterization of the testable graph properties: It s all about regularity. SIAM J. Comput., 39(1), 143.

2. Aziz, H., & Savani, R. (2016). Hedonic games. In: Handbook of Computational Social Choice, Cambridge University Press.

3. Aziz, H., Brandt, F., & Seedig, H.G. (2013). Computing desirable partitions in additively separable hedonic games. Artificial Intelligence 195.

4. Aziz, H., Harrenstein, P., Lang, J., & Wooldridge, M. (2016). Boolean hedonic games. In: Proceedings of the 15th international conference on principles of knowledge representation and reasoning.

5. Ballester, C. (2004). NP-completeness in hedonic games. Games Econom. Behavior, 49(1), 1–30.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3