Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games - Université de Rennes Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games

Dates et versions

hal-02471555 , version 1 (08-02-2020)

Identifiants

Citer

Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik. Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games. 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS), Oct 2011, Palm Springs, United States. pp.532-541, ⟨10.1109/FOCS.2011.50⟩. ⟨hal-02471555⟩
43 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More