Cores in Friend-Oriented Hedonic Games: Verification is Surprisingly Harder than Searching

03/17/2022
by   Jiehua Chen, et al.
0

We resolve an open question by Woeginger [Open Problem 13, SOFSEM '13] regarding the computational complexity of verifying whether a given coalition structure for friend-oriented preferences is stable. We show that this verification problem is coNP-complete. It remains so even when the directed friendship graph underlying the friend-oriented preferences is planar, has constant vertex-degree (i.e., each player has constant number of friends and is regarded as a friend by a constant number of other players), and the friendship preferences are symmetric. On the positive side, we observe that the verification problem becomes polynomial-time solvable if the friendship graph is acyclic or has maximum vertex-degree two.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/28/2019

A Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs

A connected component of a vertex-coloured graph is said to be colourful...
research
02/28/2019

Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs

A connected component of a vertex-coloured graph is said to be colourful...
research
10/12/2018

Chromatic Polynomials of Oriented Graphs

The oriented chromatic polynomial of a oriented graph outputs the number...
research
06/09/2018

Acyclic orientations with degree constraints

In this note we study the complexity of some generalizations of the noti...
research
11/22/2022

Stabilization of Capacitated Matching Games

An edge-weighted, vertex-capacitated graph G is called stable if the val...
research
02/14/2022

Hedonic Games and Treewidth Revisited

We revisit the complexity of the well-studied notion of Additively Separ...

Please sign up or login with your details

Forgot password? Click here to reset