6 citations · 7 across the 8 of their papers we have counts for
Showing cs.MAShow all
2 papers · 1 filter
cs.MA2025
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…
cs.MA2023★ 1 cited
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…