Approximation and Online Algorithms

DOI10.1007/11671411zbMath1177.90070OpenAlexW4210634114MaRDI QIDQ5898471

Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis

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

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Games involving graphs (91A43)

Related Items (17)

Some results of Maria Serna on strategic games: complexity of equilibria and models ⋮ The complexity of welfare maximization in congestion games ⋮ The structure and complexity of Nash equilibria for a selfish routing game ⋮ Computation of equilibria and the price of anarchy in bottleneck congestion games ⋮ A Selective Tour Through Congestion Games ⋮ Collusion in atomic splittable routing games ⋮ Unnamed Item ⋮ Performance of one-round walks in linear congestion games ⋮ Greediness and equilibrium in congestion games ⋮ Network topology and equilibrium existence in weighted network congestion games ⋮ Nash equilibria in discrete routing games with convex latency functions ⋮ How to find Nash equilibria with extreme total latency in network congestion games? ⋮ Competitive routing over time ⋮ Malicious Bayesian Congestion Games ⋮ A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games ⋮ How hard is it to find extreme Nash equilibria in network congestion games? ⋮ Computing equilibrium in network utility-sharing and discrete election games

This page was built for publication: Approximation and Online Algorithms