Sciweavers

118 search results - page 11 / 24
» Fairness and optimality in congestion games
Sort
View
ICC
2007
IEEE
158views Communications» more  ICC 2007»
14 years 2 months ago
Cooperative Game Theory for Distributed Spectrum Sharing
— There is a need for new spectrum access protocols that are opportunistic, flexible and efficient, yet fair. Game theory provides a framework for analyzing spectrum access, a ...
Juan E. Suris, Luiz A. DaSilva, Zhu Han, Allen B. ...
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 7 months ago
Optimal Partitions in Additively Separable Hedonic Games
We conduct a computational analysis of partitions in additively separable hedonic games that satisfy standard criteria of fairness and optimality. We show that computing a partiti...
Haris Aziz, Felix Brandt, Hans Georg Seedig
AAMAS
2011
Springer
13 years 2 months ago
Long-term fairness with bounded worst-case losses
How does one repeatedly choose actions so as to be fairest to the multiple beneficiaries of those actions? We examine approaches to discovering sequences of actions for which the...
Gabriel Catalin Balan, Dana Richards, Sean Luke
ICNP
2007
IEEE
14 years 2 months ago
Best Effort Session-Level Congestion Control
— Congestion caused by a large number of interacting TCP flows at a bottleneck network link is different from that caused by a lesser number of flows sending large amounts of d...
S. Ramesh, Sneha Kumar Kasera
IMC
2005
ACM
14 years 1 months ago
Understanding Congestion in IEEE 802.11b Wireless Networks
The growing popularity of wireless networks has led to cases of heavy utilization and congestion. In heavily utilized wireless networks, the wireless portion of the network is a m...
Amit P. Jardosh, Krishna N. Ramachandran, Kevin C....