Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the reversal bias of the Minimax social choice correspondence (1508.05948v2)

Published 18 Aug 2015 in math.CO and q-fin.EC

Abstract: We introduce three different qualifications of the reversal bias in the framework of social choice correspondences. For each of them, we prove that the Minimax social choice correspondence is immune to it if and only if the number of voters and the number of alternatives satisfy suitable arithmetical conditions. We prove those facts thanks to a new characterization of the Minimax social choice correspondence and using a graph theory approach. We discuss the same issue for the Borda and Copeland social choice correspondences.

Summary

We haven't generated a summary for this paper yet.