STACS 2004

DOI10.1007/b96012zbMath1122.91303OpenAlexW4236485840MaRDI QIDQ5309730

Thomas Lücking, Marios Mavronicolas, Manuel Rode, Burkhard Monien

Publication date: 1 October 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b96012

Mathematics Subject Classification ID

Noncooperative games (91A10) Network design and communication in computer systems (68M10) Games involving graphs (91A43) Combinatorial games (91A46)

Related Items (17)

The structure and complexity of Nash equilibria for a selfish routing game ⋮ The price of anarchy for polynomial social cost ⋮ Utilitarian resource assignment ⋮ Inefficiency of pure Nash equilibria in series-parallel network congestion games ⋮ Selfish Bin Packing ⋮ Cost sharing mechanisms for fair pricing of resource usage ⋮ Selfish routing with incomplete information ⋮ Nash equilibria in discrete routing games with convex latency functions ⋮ Extending the notion of rationality of selfish agents: second order Nash equilibria ⋮ Selfish bin packing ⋮ Mixed Nash equilibria in selfish routing problems with dynamic constraints ⋮ Evolutionary equilibrium in Bayesian routing games: specialization and niche formation ⋮ Stackelberg strategies for atomic congestion games ⋮ Congestion games with linearly independent paths: convergence time and price of anarchy ⋮ Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy ⋮ Facets of the Fully Mixed Nash Equilibrium Conjecture ⋮ Selfish unsplittable flows

This page was built for publication: STACS 2004