TY - JOUR U1 - Wissenschaftlicher Artikel A1 - Dehghanian, Amin A1 - Kurt, Murat A1 - Schaefer, Andrew J. T1 - Optimizing over pure stationary equilibria in consensus stopping games JF - Mathematical Programming Computation N2 - Consensus decision-making, a widely utilized group decision-making process, requires the consent of all participants. We consider consensus stopping games, a class of stochastic games arising in the context of consensus decision-making that require the consent of all players to terminate the game. We show that a consensus stopping game may have many pure stationary equilibria, which in turn raises the question of equilibrium selection. Given an objective criterion, we study the NP-hard problem of finding a best pure stationary equilibrium. We characterize the pure stationary equilibria, show that they form an independence system, and develop several families of valid inequalities. We then solve the equilibrium selection problem as a mixed-integer linear program by a branch-and-cut approach. Our computational results demonstrate the effectiveness of our approach over a commercial solver. AB - Consensus decision-making, a widely utilized group decision-making process, requires the consent of all participants. We consider consensus stopping games, a class of stochastic games arising in the context of consensus decision-making that require the consent of all players to terminate the game. We show that a consensus stopping game may have many pure stationary equilibria, which in turn raises the question of equilibrium selection. Given an objective criterion, we study the NP-hard problem of finding a best pure stationary equilibrium. We characterize the pure stationary equilibria, show that they form an independence system, and develop several families of valid inequalities. We then solve the equilibrium selection problem as a mixed-integer linear program by a branch-and-cut approach. Our computational results demonstrate the effectiveness of our approach over a commercial solver. KW - Software KW - Theoretical Computer Science Y1 - 2018 SN - 1867-2949 SS - 1867-2949 U6 - https://doi.org/10.1007/s12532-018-0151-8 DO - https://doi.org/10.1007/s12532-018-0151-8 VL - 11 IS - 2 SP - 341 EP - 380 S1 - 40 PB - Springer Science and Business Media LLC ER -