ML Anthology

The Complexity of Subelection Isomorphism Problems

Piotr Faliszewski, Krzysztof Sornat, Stanislaw Szufa
JAIR 2024 pp. 1343-1371
doi:10.1613/JAIR.1.15550 /jair/2024/faliszewski2024jair-complexity/

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

PDF JAIR Semantic Scholar

Cite

Text

Faliszewski et al. "The Complexity of Subelection Isomorphism Problems." Journal of Artificial Intelligence Research, 2024. doi:10.1613/JAIR.1.15550

Markdown

[Faliszewski et al. "The Complexity of Subelection Isomorphism Problems." Journal of Artificial Intelligence Research, 2024.](https://mlanthology.org/jair/2024/faliszewski2024jair-complexity/) doi:10.1613/JAIR.1.15550

BibTeX

@article{faliszewski2024jair-complexity,
  title     = {{The Complexity of Subelection Isomorphism Problems}},
  author    = {Faliszewski, Piotr and Sornat, Krzysztof and Szufa, Stanislaw},
  journal   = {Journal of Artificial Intelligence Research},
  year      = {2024},
  pages     = {1343-1371},
  doi       = {10.1613/JAIR.1.15550},
  volume    = {80},
  url       = {https://mlanthology.org/jair/2024/faliszewski2024jair-complexity/}
}