Hoefer, M., & Skopalik, A. (2013). On the Complexity of Pareto-Optimal Nash and Strong Equilibria. Theory of Computing Systems, 53(3), 441-453. doi:10.1007/s00224-012-9433-0.