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.

翻译：我们研究选举自成体系问题的延伸问题,重点研究存在无自成体系的次选举。具体地说,我们提出次选举自成体系和最大常见的次选举问题,并研究其计算复杂性和近似性。我们利用我们实验中的问题,对几个选举统计模型的性质提供了一些洞察力。