18 search results - page 1 / 4 » Price of Anarchy of Network Routing Games with Incomplete In... |
WINE
2005
Springer
13 years 10 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...
CISS
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract—We study pricing games in single-layer relay networks where the source routes traffic selfishly according to the strategic bids made by relays. Each relay’s bid incl...
MST
2011
12 years 11 months ago
2011
We study the impact of collusion in network games with splittable flow and focus on the well established price of anarchy as a measure of this impact. We first investigate symmet...
SAGT
2009
Springer
13 years 11 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...
SIGECOM
2008
ACM
13 years 4 months ago
2008
ACM
In this paper, we study the price of anarchy of traffic routing, under the assumption that users are partially altruistic or spiteful. We model such behavior by positing that the ...