Stackelberg thresholds in network routing games or The value of altruism
MetadataShow full item record
Sharma, Yogeshwer; Williamson, David
We study the problem of determining the minimum amount of flow required to be centrally controlled in a Stackelberg routing game in order to improve the social cost of a Nash equilibrium. We consider the special case of routing on a parallel link graph with linear delays and give a closed form expression for the above quantity.
computer science; technical report
Previously Published As