AAAI 2022technical7 citations
The Complexity of Subelection Isomorphism Problems
Piotr Faliszewski, Krzysztof Sornat, Stanisław Szufa
Abstract
We study extensions of the Election Isomorphism problem, focused on the existence of isomorphic subelections. Specifically, we propose the Subelection Isomorphism and the Maximum Common Subelection problems and study their computational complexity and approximability. Using our problems in experiments, we provide some insights into the nature of several statistical models of elections.
BibTeX
@inproceedings{aaai2022_thecomplexityofs,
title = {The Complexity of Subelection Isomorphism Problems},
author = {Piotr Faliszewski and Krzysztof Sornat and Stanisław Szufa},
booktitle = {AAAI 2022},
year = {2022}
}