Implementing generalized Condorcet social choice functions via backward induction

✍ Scribed by Bhaskar Dutta; Arunava Sen

• Publisher: Springer
• Year: 1993
• Tongue: English
• Weight: 672 KB
• Volume: 10
• Category: Article
• ISSN: 0176-1714
• DOI: 10.1007/bf00183343

✦ Synopsis

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 backward induction. However, there are no implementable selections from the Copeland or Kramer Correspondences. * We are grateful to an anonymous referee for valuable comments.