๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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

No coin nor oath required. For personal study only.

โœฆ 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.


๐Ÿ“œ SIMILAR VOLUMES