On the Complexity of Pareto-optimal Nash and Strong Equilibria

Martin Hoefer, Alexander Skopalik. On the Complexity of Pareto-optimal Nash and Strong Equilibria. In Spyros C. Kontogiannis, Elias Koutsoupias, Paul G. Spirakis, editors, Algorithmic Game Theory - Third International Symposium, SAGT 2010, Athens, Greece, October 18-20, 2010. Proceedings. Volume 6386 of Lecture Notes in Computer Science, pages 312-322, Springer, 2010. [doi]

Abstract

Abstract is missing.