144 search results - page 9 / 29 » Stackelberg Network Pricing Games |
WINE
2005
Springer
15 years 3 months ago
2005
Springer
We consider a class of networks where n agents need to send their traffic from a given source to a given destination over m identical, non-intersecting, and parallel links. For suc...
114
click to vote
CAAN
2004
Springer
15 years 3 months ago
2004
Springer
Imagine a set of self-interested clients, each of whom must choose a server from a permissible set. A server’s latency is inversely proportional to its speed, but it grows linear...
SAGT
2009
Springer
15 years 4 months ago
2009
Springer
We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...
NETCOOP
2007
Springer
15 years 3 months ago
2007
Springer
— We present both a game theoretic and a distributed algorithmic approach for the transit price negotiation problem in the interdomain routing framework. We analyze the behavior ...
104
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. Congestion games model several interesting applications, including routing and network formation games, and also possess attractive theoretical properties, including the ...