Войти
аналитика - Computational Social Choice
Computing Most Equitable Voting Rules with Verifications: A Graph Isomorphism Approach
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.
Parameterized Complexity and Challenges in Computational Social Choice: A Focus on Multi-Winner Determination and Hedonic Games
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.
Продукты | Ресурсы
© 2024 by Linnk AI