Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms

DOI10.1007/978-3-030-57980-7_19zbMath1506.91047arXiv2004.13602OpenAlexW3090676755MaRDI QIDQ2109969

Olivier Spanjaard, Magdaléna Tydrichová, Bruno Escoffier

Publication date: 21 December 2022

Full work available at URL: https://arxiv.org/abs/2004.13602

Mathematics Subject Classification ID

Integer programming (90C10) Individual preferences (91B08)

Related Items (3)

Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms ⋮ Structured preferences: a literature survey ⋮ Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results

This page was built for publication: Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms