4 papers · 1 filter
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…
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…
Control and Bribery in Stable Marriage and Stable Roommates: A Complete Complexity Landscape
Jiehua Chen, Ildikó Schlotter
We study control and bribery problems for stable matchings: A central authority (the controller, resp. briber) may add agents, delete agents, delete acceptable pairs, swap two adja…