The Complexity of Subelection Isomorphism Problems
Computer Science and Game Theory
2021-12-21 v2 Multiagent Systems
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.
Cite
@article{arxiv.2105.11923,
title = {The Complexity of Subelection Isomorphism Problems},
author = {Piotr Faliszewski and Krzysztof Sornat and Stanisław Szufa},
journal= {arXiv preprint arXiv:2105.11923},
year = {2021}
}
Comments
18 pages, 2 figures, 1 table. A preliminary conference version of this work will appear in AAAI 2022