Sciweavers

179 search results - page 5 / 36
» Asynchronous Congestion Games
Sort
View
TON
2008
79views more  TON 2008»
13 years 7 months ago
Asynchronous congestion control in multi-hop wireless networks with maximal matching-based scheduling
We consider a multi-hop wireless network shared by many users. For an interference model that constrains a node to either transmit to or receive from only one other node at a time,...
Loc Bui, Atilla Eryilmaz, R. Srikant, Xinzhou Wu
ACID
2006
298views Algorithms» more  ACID 2006»
13 years 8 months ago
Congestion Games: Optimization in Competition
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
Berthold Vöcking
SIGECOM
2005
ACM
101views ECommerce» more  SIGECOM 2005»
14 years 28 days ago
Fairness and optimality in congestion games
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Na...
ICALP
2011
Springer
12 years 10 months ago
Restoring Pure Equilibria to Weighted Congestion Games
Abstract. Congestion games model several interesting applications, including routing and network formation games, and also possess attractive theoretical properties, including the ...
Konstantinos Kollias, Tim Roughgarden
SAGT
2010
Springer
181views Game Theory» more  SAGT 2010»
13 years 5 months ago
On the Complexity of Pareto-optimal Nash and Strong Equilibria
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...
Martin Hoefer, Alexander Skopalik