
This paper presents efficient algorithms for computing most equitable voting rules with verifications by establishing a novel connection to the graph isomorphism problem, demonstrating that computing such rules is as hard as the graph isomorphism problem for many common social choice settings.


coremsg

computing-most-equitable-voting-rules-with-verifications-a-graph-isomorphism-approach


Computing Most Equitable Voting Rules with Verifications: A Graph Isomorphism Approach


title_rewrite


This article surveys the parameterized complexity of two key Computational Social Choice problems, Multi-Winner Determination and Hedonic Games, highlighting key results and outlining research challenges.


parameterized-complexity-and-challenges-in-computational-social-choice-a-focus-on-multi-winner-determination-and-hedonic-games


Parameterized Complexity and Challenges in Computational Social Choice: A Focus on Multi-Winner Determination and Hedonic Games
