Theoretical Computer Science
From MaRDI portal
Publication:5897347
DOI10.1007/b13810zbMath1257.68081OpenAlexW3144329707MaRDI QIDQ5897347
Thomas Lücking, Burkhard Monien, Marios Mavronicolas, Paul G. Spirakis, Martin Gairing
Publication date: 23 February 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13810
Analysis of algorithms and problem complexity (68Q25) (n)-person games, (n>2) (91A06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (7)
The structure and complexity of Nash equilibria for a selfish routing game ⋮ The price of anarchy for polynomial social cost ⋮ Utilitarian resource assignment ⋮ On the structure and complexity of worst-case equilibria ⋮ Incentives and coordination in bottleneck models ⋮ Cost sharing mechanisms for fair pricing of resource usage ⋮ Selfish unsplittable flows
This page was built for publication: Theoretical Computer Science
