Abstract
In this paper we give a general characterization of the minimal Maskin monotonic extensions of Condorcet consistent tournament solutions. We then compute the minimal Maskin monotonic extensions for the following rules: The top-cycle, the uncovered set, the iterated uncovered set, the minimal covering set and the Copeland rule. Moreover, we characterize the minimal Maskin monotonic extensions of the social choice rules that are generated by the top-cycle, the uncovered set, the iterated uncovered set, and the minimal covering set via the majority rule. We also give results establishing the relation between the minimal Maskin monotonic extensions in the tournament environment and the social choice environment.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call