2022
AAAI
AAAI 2022
The Complexity of Subelection Isomorphism Problems
Abstract
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.
🌉
Interdisciplinary Bridge
— Artificial Intelligence and Computer Science and Mathematics & Optimization
🧭
Keyword Pioneer
— subelection problem
🐝
Cross-Pollinator
— Artificial Intelligence, Computer Science, Computer Vision, Data Science & Analytics, Deep Learning, Healthcare & Medicine, Interdisciplinary, Knowledge & Reasoning, Machine Learning, Mathematics & Optimization, Natural Language Processing, Reinforcement Learning, Robotics, Security & Privacy, Speech & Audio