1034 search results - page 99 / 207 » Competitive generalized auctions |
CORR
2008
Springer
13 years 10 months ago
2008
Springer
In this paper two scheduling models are addressed. First is the standard model (unicast) where requests (or jobs) are independent. The other is the broadcast model where broadcast...
WAOA
2010
Springer
13 years 8 months ago
2010
Springer
The past few years have witnessed a number of interesting online algorithms for deadline scheduling in the dynamic speed scaling model (in which a processor can vary its speed to ...
SODA
2012
ACM
12 years 25 days ago
2012
ACM
We propose a general dual-fitting technique for analyzing online scheduling algorithms in the unrelated machines setting where the objective function involves weighted flow-time...
STOC
2009
ACM
14 years 11 months ago
2009
ACM
We study a general sub-class of concave games, which we call socially concave games. We show that if each player follows any no-external regret minimization procedure then the dyn...
PODC
2004
ACM
14 years 3 months ago
2004
ACM
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...