Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games

Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik. Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games. In Rafail Ostrovsky, editor, IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011. pages 532-541, IEEE, 2011. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.