Automata, Languages and Programming
From MaRDI portal
Publication:5466501
DOI10.1007/b99859zbMath1100.91003OpenAlexW2505584480MaRDI QIDQ5466501
Burkhard Monien, Martin Gairing, Manuel Rode, Thomas Lücking, Marios Mavronicolas
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
Noncooperative games (91A10) Special types of economic equilibria (91B52) Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (16)
The structure and complexity of Nash equilibria for a selfish routing game ⋮ Atomic routing games on maximum congestion ⋮ The price of anarchy for polynomial social cost ⋮ Inefficiency of pure Nash equilibria in series-parallel network congestion games ⋮ Equilibria problems on games: complexity versus succinctness ⋮ Cost sharing mechanisms for fair pricing of resource usage ⋮ A new model for selfish routing ⋮ Selfish routing with incomplete information ⋮ Extending the notion of rationality of selfish agents: second order Nash equilibria ⋮ Mixed Nash equilibria in selfish routing problems with dynamic constraints ⋮ Stackelberg strategies for atomic congestion games ⋮ Congestion games with linearly independent paths: convergence time and price of anarchy ⋮ The Influence of Link Restrictions on (Random) Selfish Routing ⋮ Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy ⋮ Facets of the Fully Mixed Nash Equilibrium Conjecture ⋮ Efficiency of Equilibria in Uniform Matroid Congestion Games
This page was built for publication: Automata, Languages and Programming
