The Complexity of Subelection Isomorphism Problems

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, mostly showing intractability. Additionally, we show experiments indicating that our problems provide meaningful insights into the nature of a number of statistical models of elections.