Strategy-proof aggregation rules and single peakedness in bounded distributive lattices
From MaRDI portal
Publication:2417403
DOI10.1007/s00355-018-1148-yzbMath1410.91210OpenAlexW2892539133MaRDI QIDQ2417403
Stefano Vannucci, Ernesto Savaglio
Publication date: 12 June 2019
Published in: Social Choice and Welfare (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00355-018-1148-y
aggregation rulebounded distributive latticesingle peakednessindividual and coalitional strategy-proofness
Related Items (4)
Pareto rationalizability by two single-peaked preferences ⋮ ON STRATEGY‐PROOFNESS AND THE SALIENCE OF SINGLE‐PEAKEDNESS ⋮ A simple construction of complete single-peaked domains by recursive tiling ⋮ Majority judgment and strategy-proofness: a characterization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weakly unimodal domains, anti-exchange properties, and coalitional strategy-proofness of aggregation rules
- Tops-only domains
- Medians in median graphs
- On the equivalence of coalitional and individual strategy-proofness properties
- The structure of strategy-proof social choice. I: General characterization and possibility results on median spaces
- Algebraic aggregation theory
- Pareto optimality, anonymity, and strategy-proofness in location problems
- The dimension of planar posets
- On the theory of aggregation
- Generalized median voter schemes and committees
- Strategy-proofness on Euclidean spaces
- The structure of non-manipulable social choice rules on a tree
- The geometry of implementation: a necessary and sufficient condition for straightforward games
- Strategy-proofness and ``median voters
- Arrowian characterizations of latticial federation consensus functions
- Median algebras
- Individual versus group strategy-proofness: when do they coincide?
- Efficient and strategy-proof voting rules: A characterization
- Voting by Committees
- Median Algebra
- Straightforward Elections, Unanimity and Phantom Voters
- A ternary operation in distributive lattices
- Trees, Lattices, Order, and Betweenness
- Medians and Betweenness
This page was built for publication: Strategy-proof aggregation rules and single peakedness in bounded distributive lattices
