The Online Best Reply Algorithm for Resource Allocation Problems
Preprint
Abstract
We study the performance of a best reply algorithm for online resource allocation problems with a diseconomy of scale. In an online resource allocation problem, we are given a set of resources and a set of requests that arrive in an online manner. Each request consists of a set of feasible allocations and an allocation is a set of resources. The total cost of an allocation vector is given by the sum of the resources' costs, where each resource's cost depends on the total load on the resource under the allocation vector. We analyze the natural online procedure where each request is allocated greedily to a feasible set of resources that minimizes the individual cost of that particular request. In the literature, this algorithm is also known as a one-round walk-in congestion games starting from the empty state. For unweighted resource allocation problems with polynomial cost functions with maximum degree $d$, upper bounds on the competitive ratio of this greedy algorithm were known only for the special cases $d\in\{1, 2, 3\}$. In this paper, we show a general upper bound on the competitive ratio of $d(d / W(\frac{1.2d-1}{d+1}))^{d+1}$ for the unweighted case where $W$ denotes the Lambert-W function on $\mathbb{R}_{\geq 0}$. For the weighted case, we show that the competitive ratio of the greedy algorithm is bounded from above by $(d/W(\frac{d}{d+1}))^{d+1}$.
Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Intrinsic Robustness of the Price of AnarchyJournal of the ACM, 2015
- The Price of Routing Unsplittable FlowSIAM Journal on Computing, 2013
- The speed of convergence in congestion games under best-response dynamicsACM Transactions on Algorithms, 2012
- The complexity of welfare maximization in congestion gamesNetworks, 2011
- Exact Price of Anarchy for Polynomial Congestion GamesSIAM Journal on Computing, 2011
- Performance of One-Round Walks in Linear Congestion GamesTheory of Computing Systems, 2010
- Tight Bounds for Selfish and Greedy Load BalancingAlgorithmica, 2010
- Competitive Online Multicommodity RoutingTheory of Computing Systems, 2009
- Selfish Load Balancing and Atomic Congestion GamesAlgorithmica, 2006
- Approximate Local Search in Combinatorial OptimizationSIAM Journal on Computing, 2004