On Hedonic Games with Common Ranking Property

• Published in: Algorithms and Complexity Vol. 11485; pp. 137 - 148
• Main Authors: Caskurlu, Bugra, Kizilkaya, Fatih Erdem
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 2019; Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Algorithmic game theory; Computational complexity; Core stability; Hedonic games; Pareto optimality
• ISBN: 3030174018; 9783030174019
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-030-17402-6_12

Hedonic games are a prominent model of coalition formation, in which each agent’s utility only depends on the coalition she resides. The subclass of hedonic games that models the formation of general partnerships [21], where output is shared equally among affiliates, is called hedonic games with common ranking property (HGCRP). Aside from their economic motivation, HGCRP came into prominence since they are guaranteed to have core stable solutions that can be found efficiently [2]. Nonetheless, a core stable solution is not necessarily a socially desirable (Pareto optimal) outcome. We improve upon existing results by proving that every instance of HGCRP has a solution that is both Pareto optimal and core stable. We establish that finding such a solution is, however, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {NP}$$\end{document}-\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {HARD}$$\end{document}, by proving the stronger statement that finding any Pareto optimal solution is \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {NP}$$\end{document}-\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {HARD}$$\end{document}. We show that the gap between the total utility of a core stable solution and that of the socially optimal solution (OPT) is bounded by |N|, where N is the set of agents, and that this bound is tight. Our investigations reveal that finding a solution, whose total utility is within a constant factor of that of OPT, is intractable.