Login / Signup
Recognizing single-peaked preferences on an arbitrary graph: Complexity and algorithms.
Bruno Escoffier
Olivier Spanjaard
Magdaléna Tydrichová
Published in:
Discret. Appl. Math. (2024)
Keyphrases
</>
global constraints
soft constraints
arc consistency
space complexity
worst case
computational complexity
learning algorithm
graph theory
multi agent systems
computationally hard
single peaked
polynomial time complexity