Recognizing top-monotonic preference profiles in polynomial time

DOI10.1613/JAIR.1.11331MaRDI QIDQ5232783zbMATH OpenOpenAlexFDO

Authors Krzysztof Magiera, Piotr Faliszewski

Publication date 13 September 2019

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.1.11331

Mathematics Subject Classification ID

Individual preferences (91B08) Voting theory (91B12)

Recommendations

• Top monotonicity: a common root for single peakedness, single crossing and the median voter result
• Preferences Single-Peaked on a Circle
• Top-pair and top-triple monotonicity
• Recognizing one-dimensional Euclidean preference profiles
• Recognizing single-peaked preferences on a tree

Cited in

(5)

• Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms
• Core-stable committees under restricted domains
• Structure of single-peaked preferences
• Recovering single-crossing preferences from approval ballots
• Recognizing one-dimensional Euclidean preference profiles

This page was built for publication: Recognizing top-monotonic preference profiles in polynomial time

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