Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 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

An axiomatic derivation of Condorcet-consistent social decision rules (2111.14417v1)

Published 29 Nov 2021 in cs.GT and math.CO

Abstract: A social decision rule (SDR) is any non-empty set-valued map that associates any profile of individual preferences with the set of (winning) alternatives. An SDR is Condorcet-consistent if it selects the set of Condorcet winners whenever this later is non-empty. We propose a characterization of Condorcet consistent SDRs with a set of minimal axioms. It appears that all these rules satisfy a weaker Condorcet principle - the top consistency - which is not explicitly based on majority comparisons while all scoring rules fail to meet it. We also propose an alternative characterization of this class of rules using Maskin monotonicity.

Citations (1)

Summary

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