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|
|Date of revision:|
|Contact details of provider:|| Postal: |
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.:
- Danilov, V. I. & Sotskov, A. I., 1993. "On strongly consistent social choice functions," Journal of Mathematical Economics, Elsevier, vol. 22(4), pages 327-346.
- 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.
- Moulin, H. & Peleg, B., 1982.
"Cores of effectivity functions and implementation theory,"
Journal of Mathematical Economics,
Elsevier, vol. 10(1), pages 115-145, June.
- Moulin, Hervé & Peleg, B., 1982. "Cores of effectivity functions and implementation theory," Economics Papers from University Paris Dauphine 123456789/13220, Paris Dauphine University.
When requesting a correction, please mention this item's handle: RePEc:usi:wpaper:489. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Fabrizio Becatti)
If references are entirely missing, you can add them using this form.