Sciweavers

1087 search results - page 50 / 218
» Dynamics in congestion games
Sort
View
QOFIS
2004
Springer
14 years 2 months ago
Multi-bid Versus Progressive Second Price Auctions in a Stochastic Environment
Pricing is considered a relevant way to control congestion and differentiate services in communication networks. Among all pricing schemes, auctioning for bandwidth has received a...
Patrick Maillé, Bruno Tuffin
SIGCOMM
1994
ACM
14 years 24 days ago
Making Greed Work in Networks: A Game-Theoretic Analysis of Switch Service Disciplines
This paper discusses congestion control from a game-theoretic perspective. There are two basic premises: (1) users are assumed to be independent and sel sh, and (2) central admini...
Scott Shenker
ICASSP
2010
IEEE
13 years 9 months ago
NC node selection game in collaborative streaming systems
Network coding has been recently proposed as an efficient method to improve throughput, minimize delays and remove the need for reconciliation between network nodes in distribute...
Nikolaos Thomos, Hyunggon Park, Eymen Kurdoglu, Pa...
JSAC
2008
177views more  JSAC 2008»
13 years 8 months ago
Adaptive Routing Strategies in IEEE 802.16 Multi-Hop Wireless Backhaul Networks Based On Evolutionary Game Theory
The high frequency segment (10-66GHz) of the IEEE 802.16 standard seems promising for the implementation of wireless backhaul networks carrying large volumes of Internet traffic. I...
Markos P. Anastasopoulos, Pantelis-Daniel M. Arapo...
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 9 months ago
Intrinsic robustness of the price of anarchy
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...
Tim Roughgarden