Online allocation and display ads optimization with surplus supply

DOI10.1007/978-3-031-22832-2_3arXiv2107.06980OpenAlexW3179951778MaRDI QIDQ6112020

Yasamin Nazari, Balasubramanian Sivan, Melika Abolhassani, Hossein Esfandiari, Yifeng Teng, Creighton Thomas

Publication date: 4 August 2023

Published in: Web and Internet Economics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2107.06980

zbMATH Keywords

online advertisingad exchangeonline resource allocation

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Marketing, advertising (90B60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal deterministic algorithm for online \(b\)-matching
• Bayesian Mechanism Design
• A Dynamic Near-Optimal Algorithm for Online Linear Programming
• Biobjective Online Bipartite Matching
• Bicriteria Online Matching: Maximizing Weight and Cardinality
• Online Ad Assignment with an Ad Exchange
• AdWords and generalized online matching
• Online Stochastic Packing Applied to Display Ad Allocation
• Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems
• Fast Algorithms for Online Stochastic Convex Programming
• Online matching with concave returns
• Online bipartite matching with unknown distributions
• Randomized Primal-Dual Analysis of RANKING for Online Bipartite Matching

This page was built for publication: Online allocation and display ads optimization with surplus supply