Sciweavers

168 search results - page 20 / 34
» The price of selfish routing
Sort
View
CCGRID
2009
IEEE
14 years 10 months ago
Efficient Grid Task-Bundle Allocation Using Bargaining Based Self-Adaptive Auction
To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle alloc...
Han Zhao, Xiaolin Li
87
Voted
ALGORITHMICA
2010
154views more  ALGORITHMICA 2010»
14 years 9 months ago
On the Convergence of Multicast Games in Directed Networks
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is ...
Angelo Fanelli, Michele Flammini, Luca Moscardelli
INFOCOM
2003
IEEE
15 years 2 months ago
Can Shortest-path Routing and TCP Maximize Utility
TCP-AQM protocols can be interpreted as distributed primal-dual algorithms over the Internet to maximize aggregate utility over source rates. In this paper we study whether TCP–...
Jiantao Wang, Lun Li, Steven H. Low, John Doyle
JSAC
2006
107views more  JSAC 2006»
14 years 9 months ago
Efficiency and Braess' Paradox under pricing in general networks
We study the flow control and routing decisions of self-interested users in a general congested network where a single profit-maximizing service provider sets prices for different ...
Xin Huang, Asuman E. Ozdaglar, Daron Acemoglu
72
Voted
INFOCOM
2007
IEEE
15 years 3 months ago
Optimal Pricing in a Free Market Wireless Network
We consider an ad-hoc wireless network operating within a free market economic model. Users send data over a choice of paths, and scheduling and routing decisions are updated dyna...
Michael J. Neely