Abstract
AbstractIn this chapter, we discuss computational problems related to ABC rules and algorithms that solve these problems. We start by discussing the computational complexity of ABC rules. As many ABC rules are computationally difficult, a thorough algorithmic analysis is paramount to a practical application of these rules.
Publisher
Springer International Publishing
Reference64 articles.
1. H. Aziz, S. Gaspers, J. Gudmundsson, S. Mackenzie, N. Mattei, and T. Walsh. Computational aspects of multi-winner approval voting. In Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems (AAMAS-2015), pages 107–115, 2015.
2. H. Aziz, M. Brill, V. Conitzer, E. Elkind, R. Freeman, and T. Walsh. Justified representation in approval-based committee voting. Social Choice and Welfare, 48(2):461–485, 2017.
3. H. Aziz, E. Elkind, S. Huang, M. Lackner, L. Sánchez-Fernández, and P. Skowron. On the complexity of extended and proportional justified representation. In Proceedings of the 32nd Conference on Artificial Intelligence (AAAI-2018), pages 902–909, 2018.
4. S. Barman, O. Fawzi, S. Ghoshal, and E. Gürpınar. Tight approximation bounds for maximum multi-coverage. In Proceedings of the 2020 International Conference on Integer Programming and Combinatorial Optimization (IPCO-2020), pages 66–77, 2020.
5. N. Barrot, L. Gourvès, J. Lang, J. Monnot, and B. Ries. Possible winners in approval voting. In Proceedings of the 3rd International Conference on Algorithmic Decision Theory (ADT-2013), pages 57–70, 2013.