Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and Algorithms
In: Proceedings of the 13th International Symposium on Algorithmic Game Theory, SAGT 2020 ; 13th International Symposium on Algorithmic Game Theory, 2020
Konferenz
Zugriff:
International audience
Titel: |
Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and Algorithms
|
---|---|
Autor/in / Beteiligte Person: | Escoffier, Bruno ; Spanjaard, Olivier ; Tydrichová, Magdaléna ; Recherche Opérationnelle (RO) ; LIP6 ; Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS) ; DECISION |
Link: | |
Zeitschrift: | Proceedings of the 13th International Symposium on Algorithmic Game Theory, SAGT 2020 ; 13th International Symposium on Algorithmic Game Theory, 2020 |
Veröffentlichung: | HAL CCSD ; Springer, 2020 |
Medientyp: | Konferenz |
DOI: | 10.1007/978-3-030-57980-7_19 |
Schlagwort: |
|
Sonstiges: |
|