An optimal algorithm for on-line bipartite matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
SIAM Journal on Computing
On-line Network Optimization Problems
Developments from a June 1996 seminar on Online algorithms: the state of the art
Optimal oblivious routing in polynomial time
Journal of Computer and System Sciences - Special issue: STOC 2003
COPE: traffic engineering in dynamic networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Making routing robust to changing traffic demands: algorithms and evaluation
IEEE/ACM Transactions on Networking (TON)
Allocating online advertisement space with unreliable estimates
Proceedings of the 8th ACM conference on Electronic commerce
AdWords and generalized online matching
Journal of the ACM (JACM)
On-line bipartite matching made simple
ACM SIGACT News
The adwords problem: online keyword matching with budgeted bidders under random permutations
Proceedings of the 10th ACM conference on Electronic commerce
Online Ad Assignment with Free Disposal
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Online Stochastic Matching: Beating 1-1/e
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Online primal-dual algorithms for maximizing ad-auctions revenue
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Optimal online assignment with forecasts
Proceedings of the 11th ACM conference on Electronic commerce
Improved bounds for online stochastic matching
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Online stochastic packing applied to display ad allocation
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
Proceedings of the 12th ACM conference on Electronic commerce
Online bipartite matching with unknown distributions
Proceedings of the forty-third annual ACM symposium on Theory of computing
Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs
Proceedings of the forty-third annual ACM symposium on Theory of computing
Online stochastic matching: online actions based on offline statistics
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Online stochastic weighted matching: improved approximation algorithms
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Robust linear optimization under general norms
Operations Research Letters
Online prophet-inequality matching with applications to ad allocation
Proceedings of the 13th ACM Conference on Electronic Commerce
Asymptotically optimal algorithm for stochastic adwords
Proceedings of the 13th ACM Conference on Electronic Commerce
SHALE: an efficient algorithm for allocation of guaranteed display advertising
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Online allocation of display ads with smooth delivery
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Budget smoothing for internet ad auctions: a game theoretic approach
Proceedings of the fourteenth ACM conference on Electronic commerce
Whole-page optimization and submodular welfare maximization with online bidders
Proceedings of the fourteenth ACM conference on Electronic commerce
Hi-index | 0.00 |
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists of a bipartite graph G = (X, Y, E), where the nodes of Y along with their corresponding capacities are known beforehand to the algorithm, and the nodes of X arrive online. When a node of X arrives, its incident edges, and their respective weights are revealed, and the algorithm can match it to a neighbor in Y. The objective is to maximize the weight of the final matching, while respecting the capacities. When nodes arrive in an adversarial order, the best competitive ratio is known to be 1 - 1/e, and it can be achieved by the Ranking [18], and its generalizations (Balance [16, 21]). On the other hand, if the nodes arrive through a random permutation, it is possible to achieve a competitive ratio of 1 -- ε [9]. In this paper we design algorithms that achieve a competitive ratio better than 1 -- 1/e on average, while preserving a nearly optimal worst case competitive ratio. Ideally, we want to achieve the best of both worlds, i.e, to design an algorithm with the optimal competitive ratio in both the adversarial and random arrival models. We achieve this for unweighted graphs, but show that it is not possible for weighted graphs. In particular, for unweighted graphs, under some mild assumptions, we show that Balance achieves a competitive ratio of 1 -- ε in a random permutation model. For weighted graphs, however, we prove this is not possible; we prove that no online algorithm that achieves an approximation factor of 1 -- 1/ε for the worst-case inputs may achieve an average approximation factor better than 97.6% for random inputs. In light of this hardness result, we aim to design algorithms with improved approximation ratios in the random arrival model while preserving the competitive ratio of 1 -- 1/ε in the worst case. To this end, we show the algorithm proposed by [21] achieves a competitive ratio of 0.76 for the random arrival model, while having a 1 -- 1/ε ratio in the worst case.