A simple construction of complete single-peaked domains by recursive tiling
From MaRDI portal
Publication:2283307
DOI10.1007/S00186-019-00685-7zbMATH Open1435.91086OpenAlexW2979461081WikidataQ127107129 ScholiaQ127107129MaRDI QIDQ2283307FDOQ2283307
Authors: Ping Zhan
Publication date: 30 December 2019
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-019-00685-7
Recommendations
Cites Work
- Title not available (Why is that?)
- Submodular functions and optimization.
- Title not available (Why is that?)
- Higher Bruhat orders and cyclic hyperplane arrangements
- A Possibility Theorem on Majority Decisions
- Rhombic tilings of polygons and classes of reduced words in Coxeter groups
- Acyclic sets of linear orders
- Acyclic sets of linear orders via the Bruhat orders
- Title not available (Why is that?)
- Condorcet domains of tiling type
- Plücker environments, wiring and tiling diagrams, and weakly separated set-systems
- POLYHEDRA AND OPTIMIZATION RELATED TO A WEAK ABSOLUTE MAJORIZATION ORDERING
- The single-peaked domain revisited: a simple global characterization
- On single-peaked domains and min-max rules
- Title not available (Why is that?)
- How Large are Transitive Simple Majority Domains?
- Strategy-proof aggregation rules and single peakedness in bounded distributive lattices
- One-dimensional mechanism design
- Matching with single-peaked preferences
Cited In (4)
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)