Abstract
It is shown that, under a very comprehensive notion of single peakedness, an aggregation rule on a bounded distributive lattice is strategy-proof on any rich domain of single peaked total preorders if and only if it admits one of three distinct and mutually equivalent representations by lattice-polynomials, namely whenever it can be represented as a generalized weak consensus rule, a generalized weak sponsorship rule , or an iterated medianrule. The equivalence of individual and coalitional strategy-proofness that is known to hold for single peaked domains in bounded linearly ordered sets and in finite trees typically fails in such an extended setting. A related impossibility result concerning non-trivial anonymous and coalitionally strategy-proof aggregation rules is also obtained.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Similar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.