6 search results - page 2 / 2 » On the Complexity of Pareto-optimal Nash and Strong Equilibr... |
FOCS
2009
IEEE
14 years 7 hour ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...