A Stackelberg Strategy for Routing Flow over Time

Details A Stackelberg Strategy for Routing Flow over Time A Stackelberg Strategy for Routing Flow over Time

2010-10-14

arxiv.org/abs/1010.3034v1

Computer Science

Computer Science and Game Theory

Scientific paper

Routing games are used to to understand the impact of individual users' decisions on network efficiency. Most prior work on routing games uses a simplified model of network flow where all flow exists simultaneously, and users care about either their maximum delay or their total delay. Both of these measures are surrogates for measuring how long it takes to get all of a user's traffic through the network. We attempt a more direct study of how competition affects network efficiency by examining routing games in a flow over time model. We give an efficiently computable Stackelberg strategy for this model and show that the competitive equilibrium under this strategy is no worse than a small constant times the optimal, for two natural measures of optimality.

Affiliated with

Also associated with

No associations

Rating

A Stackelberg Strategy for Routing Flow over Time does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Stackelberg Strategy for Routing Flow over Time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Stackelberg Strategy for Routing Flow over Time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-203171