Philip Neary

Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems

We investigate the difficulty of finding economically efficient solutions to coordination problems on graphs. Our work focuses on two forms of coordination problem: pure-coordination games and anti-coordination games. We consider three objectives in the context of simple binary-action polymatrix gam…