EUVIMEDEUVIMED entdecken
Crossref

Online Matching and Ad Allocation

Aranyak Mehta

Foundations and Trends® in Theoretical Computer Science · 17.10.2013 · 8 (4) · 265-368

DOI: 10.1561/0400000057 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Foundations and Trends® in Theoretical Computer Science, online erschienen am 17.10.2013. Verfasst von Aranyak Mehta. Die Arbeit wurde bisher 228-mal zitiert (Crossref) und nennt 93 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Zitieren

APA

Mehta, A. (2013). Online Matching and Ad Allocation. Foundations and Trends® in Theoretical Computer Science, 8(4), 265-368. https://doi.org/10.1561/0400000057

Vancouver

Mehta A. Online Matching and Ad Allocation. Foundations and Trends® in Theoretical Computer Science. 2013;8(4):265-368. doi:10.1561/0400000057

BibTeX
@article{Mehta2013,
  author = {Mehta, Aranyak},
  title = {Online Matching and Ad Allocation},
  journal = {Foundations and Trends® in Theoretical Computer Science},
  year = {2013},
  volume = {8},
  number = {4},
  pages = {265--368},
  doi = {10.1561/0400000057}
}
Kostenlos starten →