Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and Algorithms.

Bruno Escoffier Olivier Spanjaard Magdaléna Tydrichová

Published in: CoRR (2020)

Keyphrases

computationally hard
single peaked
computational complexity
graph theory
learning algorithm
space complexity
worst case
polynomial time complexity
optimal solution
cooperative
graph structure
hill climbing