On Concept Lattices of Efficiently Solvable Voting Protocols
It is shown that concept lattices can be attached in a natural way to any voting protocol. The concept lattices of some voting protocols that are solvable with respect to some prominnent solution concepts and outcome-efficient are studied: it is proved that they typically amount to chains
|Date of creation:||Nov 2006|
|Contact details of provider:|| Postal: Piazza S.Francesco,7 - 53100 Siena|
Web page: http://www.deps.unisi.it/
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Moulin, H. & Peleg, B., 1982. "Cores of effectivity functions and implementation theory," Journal of Mathematical Economics, Elsevier, vol. 10(1), pages 115-145, June.
- Otten Gert-Jan & Borm Peter & Storcken Ton & Tijs Stef, 1995.
"Effectivity Functions and Associated Claim Game Correspondences,"
Games and Economic Behavior,
Elsevier, vol. 9(2), pages 172-190, May.
- Otten, G.J.M. & Borm, P.E.M. & Storcken, T. & Tijs, S.H., 1995. "Effectivity functions and associated claim game correspondences," Other publications TiSEM 0789742b-ab29-48ba-89d9-f, Tilburg University, School of Economics and Management.
- Danilov, V. I. & Sotskov, A. I., 1993. "On strongly consistent social choice functions," Journal of Mathematical Economics, Elsevier, vol. 22(4), pages 327-346. Full references (including those not matched with items on IDEAS)