Sina Akbari, Adolfo R. Escobedo. Lower Bounds on Kemeny Rank Aggregation with Non-Strict Rankings. In IEEE Symposium Series on Computational Intelligence, SSCI 2021, Orlando, FL, USA, December 5-7, 2021. pages 1-8, IEEE, 2021. [doi]
@inproceedings{AkbariE21,
title = {Lower Bounds on Kemeny Rank Aggregation with Non-Strict Rankings},
author = {Sina Akbari and Adolfo R. Escobedo},
year = {2021},
doi = {10.1109/SSCI50451.2021.9660119},
url = {https://doi.org/10.1109/SSCI50451.2021.9660119},
researchr = {https://researchr.org/publication/AkbariE21},
cites = {0},
citedby = {0},
pages = {1-8},
booktitle = {IEEE Symposium Series on Computational Intelligence, SSCI 2021, Orlando, FL, USA, December 5-7, 2021},
publisher = {IEEE},
isbn = {978-1-7281-9048-8},
}