Recognizing single-peaked preferences on an arbitrary graph: Complexity and algorithms
Open Access
- 23 February 2024
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 348, 301-319
Abstract
No abstract availableKeywords
All Related Versions
This publication has 18 references indexed in Scilit:
- The complexity of manipulative attacks in nearly single-peaked electoratesArtificial Intelligence, 2014
- PrefLib: A Library for Preferences http://www.preflib.org2013
- A New Instance-Based Label Ranking Approach Using the Mallows Model2009
- Trust-based recommendation systems2008
- The structure of strategy-proof social choice — Part I: General characterization and possibility results on median spacesJournal of Economic Theory, 2007
- A Polynomial Time Algorithm for Unidimensional Unfolding RepresentationsJournal of Algorithms, 1994
- Recognizing single-peaked preferences on a treeMathematical Social Sciences, 1989
- Stable matching with preferences derived from a psychological modelOperations Research Letters, 1986
- Single-peaked orders on a treeMathematical Social Sciences, 1982
- On the Rationale of Group Decision-makingJournal of Political Economy, 1948