Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and Algorithms - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

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

Bruno Escoffier
Olivier Spanjaard
Magdaléna Tydrichová
  • Function : Author

Dates and versions

hal-02979839 , version 1 (27-10-2020)

Identifiers

Cite

Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová. Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and Algorithms. 13th International Symposium on Algorithmic Game Theory, SAGT 2020, Sep 2020, Augsburg, Germany. pp.291-306, ⟨10.1007/978-3-030-57980-7_19⟩. ⟨hal-02979839⟩
57 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More