A simple construction of complete single-peaked domains by recursive tiling

DOI10.1007/S00186-019-00685-7MaRDI QIDQ2283307zbMATH OpenOpenAlexWikidataFDO

Authors Ping Zhan

Publication date 30 December 2019

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00186-019-00685-7

zbMATH Keywords

single-peaked domainBruhat orderrhombus tilingCondorcet paradox

Mathematics Subject Classification ID

Social choice (91B14)

Recommendations

• Condorcet domains satisfying Arrow's single-peakedness
• The single-peaked domain revisited: a simple global characterization
• A characterization of the single-peaked domain
• Constructing large peak-pit Condorcet domains
• Single-peaked choice

Cites work

• scientific article; zbMATH DE number 6909273 (Why is no real title available?)
• scientific article; zbMATH DE number 3148878 (Why is no real title available?)
• scientific article; zbMATH DE number 5556709 (Why is no real title available?)
• scientific article; zbMATH DE number 1126912 (Why is no real title available?)
• A Possibility Theorem on Majority Decisions
• Acyclic sets of linear orders
• Acyclic sets of linear orders via the Bruhat orders
• Condorcet domains of tiling type
• Higher Bruhat orders and cyclic hyperplane arrangements
• How Large are Transitive Simple Majority Domains?
• Matching with single-peaked preferences
• On single-peaked domains and min-max rules
• One-dimensional mechanism design
• POLYHEDRA AND OPTIMIZATION RELATED TO A WEAK ABSOLUTE MAJORIZATION ORDERING
• Plücker environments, wiring and tiling diagrams, and weakly separated set-systems
• Rhombic tilings of polygons and classes of reduced words in Coxeter groups
• Strategy-proof aggregation rules and single peakedness in bounded distributive lattices
• Submodular functions and optimization.
• The single-peaked domain revisited: a simple global characterization

Cited in

(4)

• Condorcet domains satisfying Arrow's single-peakedness
• The likelihood of single-peaked preferences under classic and new probability distribution assumptions
• Constructing large peak-pit Condorcet domains
• Extended random assignment mechanisms on a family of good sets

This page was built for publication: A simple construction of complete single-peaked domains by recursive tiling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2283307)