2 citations · 4 across the 10 of their papers we have counts for
11 papers
Control in Hedonic Games
Jiehua Chen, Jakob Guttmann, Merisa Mustajbašić +1
We initiate the study of control in hedonic games, where an external actor influences coalition formation by adding or deleting agents. We consider three basic control goals (1) en…
Partitioned Combinatorial Optimization Games
Jiehua Chen, Christian Hatschka, Sofia Simola
We propose a class of cooperative games, called d Partitioned Compbinatorial Optimization Games (PCOGs). The input of PCOG consists of a set of agents and a combinatorial structure…
FPT-Approximability of Stable Matching Problems
Jiehua Chen, Sanjukta Roy, Sofia Simola
We study parameterized approximability of three optimization problems related to stable matching: (1) Min-BP-SMI: Given a stable marriage instance and a number k, find a size-at-le…
Parameterized Complexity of Hedonic Games with Enemy-Oriented Preferences
Martin Durand, Laurin Erlacher, Johanne Müller Vistisen +1
Hedonic games model settings in which a set of agents have to be partitioned into groups which we call coalitions. In the enemy aversion model, each agent has friends and enemies,…
Computational Social Choice: Parameterized Complexity and Challenges
Jiehua Chen, Christian Hatschka, Sofia Simola
We survey two key problems-Multi-Winner Determination and Hedonic Games in Computational Social Choice, with a special focus on their parameterized complexity, and propose some res…
Parameterized Algorithms for Optimal Refugee Resettlement
Jiehua Chen, Ildikó Schlotter, Sofia Simola
We study variants of the Optimal Refugee Resettlement problem where a set of refugee families need to be allocated to a set of possible places of resettlement in a feasible…
Efficient Algorithms for Monroe and CC Rules in Multi-Winner Elections with (Nearly) Structured Preferences
Jiehua Chen, Christian Hatschka, Sofia Simola
We investigate winner determination for two popular proportional representation systems: the Monroe and Chamberlin-Courant (abbrv. CC) systems. Our study focuses on (nearly) single…
Game Implementation: What Are the Obstructions?
Jiehua Chen, Sebastian Vincent Haydn, Negar Layegh Khavidaki +2
In many applications, we want to influence the decisions of independent agents by designing incentives for their actions. We revisit a fundamental problem in this area, called GAME…
Hedonic Games With Friends, Enemies, and Neutrals: Resolving Open Questions and Fine-Grained Complexity
Jiehua Chen, Gergely Csáji, Sanjukta Roy +1
We investigate verification and existence problems for prominent stability concepts in hedonic games with friends, enemies, and optionally with neutrals [8, 16]. We resolve several…
Multidimensional Manhattan Preferences
Jiehua Chen, Martin Nöllenburg, Sofia Simola +2
A preference profile (i.e., a collection of linear preference orders of the voters over a set of alternatives) with alternatives and voters is -Manhattan (resp. -Eucl…
Profile-based optimal stable matchings in the Roommates problem
Sofia Simola, David Manlove
The stable roommates problem can admit multiple different stable matchings. We have different criteria for deciding which one is optimal, but computing those is often NP-hard. We s…