scientific article; zbMATH DE number 2119661
From MaRDI portal
Publication:4828932
zbMath1258.90017MaRDI QIDQ4828932
Publication date: 29 November 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Other game-theoretic models (91A40) Traffic problems in operations research (90B20) Discrete location and assignment (90B80)
Related Items (14)
Efficient and fair routing for mesh networks ⋮ Approximating Wardrop equilibria with finitely many agents ⋮ On the impact of player capability on congestion games ⋮ On the performance of approximate equilibria in congestion games ⋮ Truthful mechanisms for selfish routing and two-parameter agents ⋮ Distributed Learning of Wardrop Equilibria ⋮ On the severity of Braess's paradox: designing networks for selfish users is hard ⋮ Sensitivity of Wardrop equilibria ⋮ Tradeoffs in worst-case equilibria ⋮ Sensitivity of Wardrop Equilibria ⋮ Stackelberg strategies for selfish routing in general multicommodity networks ⋮ Traffic Networks and Flows over Time ⋮ Inequality and Network Formation Games ⋮ Efficiency and fairness of system-optimal routing with user constraints
This page was built for publication:
