6 citations · 7 across the 8 of their papers we have counts for
8 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…
How Hard is it to Explain Preferences Using Few Boolean Attributes?
Clemens Anzinger, Jiehua Chen, Christian Hatschka +2
We study the computational complexity of explaining preference data through Boolean attribute models (BAMs), motivated by extensive research involving attribute models and their pr…
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…
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…
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…
Deontic Paradoxes in ASP with Weak Constraints
Christian Hatschka, Agata Ciabattoni, Thomas Eiter
The rise of powerful AI technology for a range of applications that are sensitive to legal, social, and ethical norms demands decision-making support in presence of norms and regul…
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…
Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts
Cornelius Brand, Esra Ceylan, Christian Hatschka +2
Decompositional parameters such as treewidth are commonly used to obtain fixed-parameter algorithms for NP-hard graph problems. For problems that are W[1]-hard parameterized by tre…