Computing Kemeny Rankings From d-Euclidean Preferences

Hamm, Thekla; Lackner, Martin; Rapberger, Anna

doi:10.1007/978-3-030-87756-9_10

by Thekla Hamm, Martin Lackner, Anna Rapberger

Reference:

Computing Kemeny Rankings From d-Euclidean PreferencesThekla Hamm, Martin Lackner, Anna Rapberger7th International Conference on Algorithmic Decision Theory (ADT'21), Proceedings, pages 147–161, 2021, Lecture Notes in Computer Science.

Bibtex Entry:

@string{lncs="Lecture Notes in Computer Science"}
@inproceedings{HammLR21,
  title={Computing Kemeny Rankings From d-Euclidean Preferences},
  author={Thekla Hamm and Martin Lackner and Anna Rapberger},
  year = {2021},
  publisher = {LNCS},
  booktitle = {7th International Conference on Algorithmic Decision Theory (ADT'21), Proceedings},
  Xeditor    = {Dimitris Fotakis and
               David R{\'{\i}}os Insua},
  volume    = {13023},
  pages     = {147--161},
  url       = {https://doi.org/10.1007/978-3-030-87756-9\_10},
  doi       = {10.1007/978-3-030-87756-9\_10},
  timestamp = {Fri, 29 Oct 2021 16:42:36 +0200},
  biburl    = {https://dblp.org/rec/conf/aldt/HammLR21.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}