The following pages link to (Q4828932):
Displaying 13 items.
- Approximating Wardrop equilibria with finitely many agents (Q352247) (← links)
- On the performance of approximate equilibria in congestion games (Q634681) (← links)
- Truthful mechanisms for selfish routing and two-parameter agents (Q647482) (← links)
- Sensitivity of Wardrop equilibria (Q987396) (← links)
- Stackelberg strategies for selfish routing in general multicommodity networks (Q1017909) (← links)
- On the severity of Braess's paradox: designing networks for selfish users is hard (Q2496322) (← links)
- Tradeoffs in worst-case equilibria (Q2503349) (← links)
- Efficient and fair routing for mesh networks (Q2638366) (← links)
- Efficiency and fairness of system-optimal routing with user constraints (Q3418209) (← links)
- Distributed Learning of Wardrop Equilibria (Q3543331) (← links)
- Traffic Networks and Flows over Time (Q3637317) (← links)
- Inequality and Network Formation Games (Q4985786) (← links)
- Sensitivity of Wardrop Equilibria (Q5459981) (← links)
