To access the full text documents, please follow this link: http://hdl.handle.net/2117/86307
dc.contributor | Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics |
---|---|
dc.contributor.author | Álvarez Faura, M. del Carme |
dc.contributor.author | Francès, Guillem |
dc.date | 2007-09 |
dc.identifier.citation | Álvarez, C., Francès, G. "Maximum congestion games on networks: How can we compute their equilibria?". 2007. |
dc.identifier.uri | http://hdl.handle.net/2117/86307 |
dc.language.iso | eng |
dc.relation | LSI-07-30-R |
dc.rights | info:eu-repo/semantics/openAccess |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
dc.subject | Network congestion games |
dc.subject | Nash equilibria |
dc.subject | Computational complexity |
dc.subject | Edge-disjoint paths |
dc.title | Maximum congestion games on networks: How can we compute their equilibria? |
dc.type | info:eu-repo/semantics/publishedVersion |
dc.type | info:eu-repo/semantics/report |
dc.description.abstract |