Approximation and Online Algorithms
From MaRDI portal
Publication:5898471
DOI10.1007/11671411zbMath1177.90070MaRDI QIDQ5898471
Dimitris Fotakis, Paul G. Spirakis, Spyros C. Kontogiannis
Publication date: 12 February 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11671411
90B18: Communication networks in operations research
68M10: Network design and communication in computer systems
91A43: Games involving graphs
Related Items
Performance of one-round walks in linear congestion games, Competitive routing over time, The structure and complexity of Nash equilibria for a selfish routing game, Nash equilibria in discrete routing games with convex latency functions, How to find Nash equilibria with extreme total latency in network congestion games?, How hard is it to find extreme Nash equilibria in network congestion games?, Collusion in atomic splittable routing games, The complexity of welfare maximization in congestion games, Malicious Bayesian Congestion Games