Computing Pure-Strategy Nash Equilibria in a Two-Party Policy Competition: Existence and Algorithmic Approaches

This paper investigates the computation of pure-strategy Nash equilibria in a two-party policy competition. It explores the existence of such equilibria and proposes algorithmic approaches to find them. The research is valuable for understanding strategic interactions in political science and policy making, particularly in scenarios where parties compete on policy platforms. The paper's strength lies in its formal analysis and the development of algorithms. However, the practical applicability of the algorithms and the sensitivity of the results to the model's assumptions could be areas for further investigation.