Online Matching and AD Allocation

by Aranyak Mehta

Overview

Matching is a classic problem with a rich history and a significant impact on both the theory of algorithms and in practice. Recently, there has been a surge of interest in the online version of matching and its generalizations. This is 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. Online Matching and Ad Allocation surveys the key problems, models, and algorithms from online matchings, as well as their implication in the practice of ad allocation. It provides a classification of the problems in this area, an introduction into the techniques used, a glimpse into the practical impact, and ponders some of the open questions that will be of interest in the future. 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. Online Matching and Ad Allocation is an ideal primer for anyone interested in matching, and particularly in the online version of the problem, in bipartite graphs

Product Details

ISBN-13:	9781601987181
Publisher:	Now Publishers
Publication date:	10/17/2013
Series:	Foundations and Trends in Theoretical Computer Science , #24
Pages:	120
Product dimensions:	6.14(w) x 9.21(h) x 0.25(d)

Table of Contents

1: Introduction 2: Classification: Problems and Models 3: Online Bipartite Matching 4: Online Vertex-Weighted Bipartite Matching 5: Adwords 6: The Online Primal-Dual View 7: Display Ads 8: Online Submodular Welfare Maximization 9: Applications 10: Related Models and Future Directions. References.