Verifying Axiomatic Satisfiability of Voting Rules in COMPSOC

Abstract

In group decision-making, achieving a consensus satisfying everyone's preferences is still a challenging problem. Adopting the right aggregation algorithm becomes essential for the success of such procedures encountered, for example, in voting. This problem is studied in social choice theory, leading to the Computational Social Choice Competition (COMPSOC), which offers a principled way to benchmark voting rules. This paper delves into the evaluation criteria for such rules and attempts to go beyond utilitarian metrics. Recognizing the significance of integrating conventional axioms from social choice theory, we propose a family of algorithms that assess the axiomatic satisfiability of well-known rules (Borda, Copeland, Simpson, etc.). Our results contribute to the theoretical and practical study of voting rules.