Online Matching and Ad Allocation
Author:
Top Cited Papers
- 17 October 2013
- journal article
- research article
- Published by Emerald Publishing in Foundations and Trends® in Theoretical Computer Science
- Vol. 8 (4) , 265-368
Abstract
Matching is a classic problem with a rich history and a significant impact, both on the theory of algorithms and in practice. Recently there has been a surge of interest in the online version of matching and its generalizations, due to the important new application domain of Internet advertising. The theory of online matching and allocation has played a critical role in designing algorithms for ad allocation. This monograph surveys the key problems, models and algorithms from online matchings, as well as their implication in the practice of ad allocation. The goal is to provide a classification of the problems in this area, an introduction into the techniques used, a glimpse into the practical impact, and to provide direction in terms of open questions. Matching continues to find core applications in diverse domains, and the advent of massive online and streaming data emphasizes the future applicability of the algorithms and techniques surveyed here.Keywords
This publication has 44 references indexed in Scilit:
- Improved analysis of the greedy algorithm for stochastic matchingInformation Processing Letters, 2011
- The Design of Competitive Online Algorithms via a Primal—Dual ApproachFoundations and Trends® in Theoretical Computer Science, 2009
- Inapproximability Results for Combinatorial Auctions with Submodular Utility FunctionsAlgorithmica, 2007
- AdWords and generalized online matchingJournal of the ACM, 2007
- Combinatorial auctions with decreasing marginal utilitiesGames and Economic Behavior, 2006
- Pairwise kidney exchangeJournal of Economic Theory, 2005
- A Polynomial Time Approximation Scheme for the Multiple Knapsack ProblemSIAM Journal on Computing, 2005
- Randomized greedy matching. IIRandom Structures & Algorithms, 1995
- Randomized greedy matchingRandom Structures & Algorithms, 1991
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955