![]() |
CiteULike | ![]() |
YoshiY's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Implementation of voting operatorsby: A. Stefanescu, M. Ferrara
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractWe show that a theory of implementation can be developed in the Aizerman–Aleskerov framework, capturing the main ideas regarding Nash implementation in the Arrovian case. In fact we obtain the counterparts of the results of [Maskin, E., 1977. Nash Equilibrium and Welfare Optimality. MIT, Mimeo] and [Moore, J., Repullo, R., 1990. Nash implementation. A full characterization. Econometrica 58, 1038–1100] in the new framework. We also propose a restatement of the implementation problem for voting operators, designing a direct mechanism where the individual strategies coincide with the choice profiles. Preserving the original sense of the strategy-proofness, if a voting rule is implementable then no individual can benefit by misrepresenting his options.
BibTeX record
RIS record