CORR
2010
Springer
13 years 9 months ago
2010
Springer
We consider the discrepancy problem of coloring n intervals with k colors such that at each point on the line, the maximal difference between the number of intervals of any two co...
ICALP
2003
Springer
14 years 5 months ago
2003
Springer
We study the number of steps required to reach a pure Nash Equilibrium in a load balancing scenario where each job behaves selfishly and attempts to migrate to a machine which will...
SPAA
2009
ACM
14 years 7 months ago
2009
ACM
We consider a dynamic load balancing scenario in which users allocate resources in a non-cooperative and selfish fashion. The perceived performance of a resource for a user decre...