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
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
For technical questions regarding this item, or to correct its listing, contact: (Fabrizio Becatti).
Related research
Keywords:
Find related papers by JEL classification: C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General D70 - Microeconomics - - Analysis of Collective Decision-Making - - - General D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
This paper has been announced in the following NEP Reports:
References listed on IDEAS 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.:
Cited by: (explanations, 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.)