Sciweavers

118 search results - page 21 / 24
» Fairness and optimality in congestion games
Sort
View
CORR
2010
Springer
168views Education» more  CORR 2010»
13 years 7 months ago
Competition of Wireless Providers for Atomic Users
We study a problem where wireless service providers compete for heterogenous and atomic (non-infinitesimal) wireless users. The users differ in their utility functions as well as ...
Vojislav Gajic, Jianwei Huang, Bixio Rimoldi
NETWORK
2007
148views more  NETWORK 2007»
13 years 7 months ago
Integration of IEEE 802.11 WLANs with IEEE 802.16-based multihop infrastructure mesh/relay networks: A game-theoretic approach t
One of the promising applications of IEEE 802.16 (WiMAX)-based wireless mesh/relay networks is to provide infrastructure/backhaul support for IEEE 802.11based mobile hotspots. In ...
Dusit Niyato, Ekram Hossain
ATAL
2009
Springer
14 years 2 months ago
Effective tag mechanisms for evolving cooperation
Certain observable features (tags), shared by a group of similar agents, can be used to signal intentions and can be effectively used to infer unobservable properties. Such infere...
Matthew Matlock, Sandip Sen
SIGCOMM
2012
ACM
11 years 10 months ago
Finishing flows quickly with preemptive scheduling
Today’s data centers face extreme challenges in providing low latency. However, fair sharing, a principle commonly adopted in current congestion control protocols, is far from o...
Chi-Yao Hong, Matthew Caesar, Brighten Godfrey
SOFSEM
2010
Springer
14 years 4 months ago
Regret Minimization and Job Scheduling
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
Yishay Mansour