Sciweavers

168 search results - page 13 / 34
» The price of selfish routing
Sort
View
JSAC
2008
123views more  JSAC 2008»
14 years 9 months ago
A Game Theoretical Framework for Dynamic Pricing-Based Routing in Self-Organized MANETs
In self-organized mobile ad hoc networks (MANETs) where each user is its own authority, fully cooperative behaviors, such as unconditionally forwarding packets for each other or ho...
Zhu Ji, Wei Yu, K. J. Ray Liu
INFOCOM
2010
IEEE
14 years 8 months ago
Truthful Least-Priced-Path Routing in Opportunistic Spectrum Access Networks
We study the problem of finding the least-priced path (LPP) between a source and a destination in opportunistic spectrum access (OSA) networks. This problem is motivated by econo...
Tao Shu, Marwan Krunz
IATA
1999
Springer
15 years 1 months ago
Market-Based Call Routing in Telecommunications Networks Using Adaptive Pricing and Real Bidding
We present a market-based approach to call routing in telecommunications networks. A system architecture is described that allows self-interested agents, representing various netwo...
M. A. Gibney, Nicholas R. Jennings, N. J. Vriend, ...
WINE
2010
Springer
177views Economy» more  WINE 2010»
14 years 7 months ago
Braess's Paradox in Large Sparse Graphs
Braess's paradox, in its original context, is the counter-intuitive observation that, without lessening demand, closing roads can improve traffic flow. With the explosion of d...
Fan Chung, Stephen J. Young
WINE
2005
Springer
107views Economy» more  WINE 2005»
15 years 3 months ago
Price of Anarchy of Network Routing Games with Incomplete Information
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...
Dinesh Garg, Yadati Narahari