Implementing generalized Condorcet socia
โ
Bhaskar Dutta; Arunava Sen
๐
Article
๐
1993
๐
Springer
๐
English
โ 672 KB
It is shown that solutions of generalized binary voting procedures are implementable via backward induction in sequential mechanisms. This implies that a rich class of generalized Condorcet Social Choice Functions including, for example, selections from the uncovered set, are implementable via backw