Automata, Languages and Programming
From MaRDI portal
Publication:5466497
DOI10.1007/b99859zbMath1099.90512MaRDI QIDQ5466497
Dimitris Fotakis, Paul G. Spirakis, Spyros C. Kontogiannis
Publication date: 24 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99859
quadratic programming; price of anarchy; pure Nash equilibria; network congestion games; unsplittable flows
91A10: Noncooperative games
90C20: Quadratic programming
90B18: Communication networks in operations research
68M10: Network design and communication in computer systems
91A43: Games involving graphs
90B10: Deterministic network models in operations research
Related Items
Convergence and approximation in potential games, Equilibria problems on games: complexity versus succinctness, On best response dynamics in weighted congestion games with polynomial delays, Selfish routing with incomplete information, Mixed Nash equilibria in selfish routing problems with dynamic constraints