1. Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, Cambridge (2009)
2. Bachrach, Y., Betzler, N., Faliszewski, P.: Probabilistic possible winner determination. In: Proceedings of the 24th AAAI Conference on Artificial Intelligence, pp. 697–702. AAAI Press (2010)
3. Baumeister, D., Hogrebe, T.: Complexity of election evaluation and probabilistic robustness. In: Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, pp. 1771–1773. IFAAMAS (2020)
4. Baumeister, D., Hogrebe, T.: Complexity of scheduling and predicting round-robin tournaments. In: Proceedings of the 20th International Conference on Autonomous Agents and Multiagent Systems, pp. 178–186. IFAAMAS (2021)
5. Baumeister, D., Hogrebe, T., Rey, L.: Generalized distance bribery. In: Proceedings of the 33rd AAAI Conference on Artificial Intelligence, pp. 1764–1771. AAAI Press (2019)