telecommunication networks / online routing problem / greedy online algorithm / traffic networks / transportation network / online selfish routing game / priority-based selfish routing internet / transportation networks / arbitrary singlecommodity networks / online competitiveness results / feasible solution / multi-commodity networks / explicit algorithm / online version / feasible solutions / parallel link networks / large internet presence / /
Organization
McGill University / /
Person
Babak Farzad / Adrian Vetta / Neil Olver / /
Position
single player / model for this case / nonatomic player / same player / player / priority-based selfish routing model / considering atomic and nonatomic agents / model / by picking the priority scheme appropriately / /
A Priority-Based Model of Routing Babak Farzad, Neil Olver and Adrian Vetta∗ February 5, 2008 Abstract We consider a priority-based selfish routing model, where agents may have different