7 papers
Multi-Winner Voting Games in TU and NTU: When is the Core Always Non-Empty?
Jiehua Chen, Christian Hatschka
Multi-winner approval voting selects a size- committee that aggregates voters' approval preferences over a set of alternatives. A central question is coalitional stability: No c…
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…
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…
Multi-Organizational Scheduling: Individual Rationality, Optimality, and Complexity
Jiehua Chen, Martin Durand, Christian Hatschka
We investigate multi-organizational scheduling problems, building upon the framework introduced by Pascual et al.[2009]. In this setting, multiple organizations each own a set of i…