Online Stochastic Packing Applied to Display Ad Allocation-Reference-Cited by-同舟云学术

Online Stochastic Packing Applied to Display Ad Allocation

Published:2010 Issue: Volume: Page:182-194
ISSN:0302-9743
Container-title:Algorithms – ESA 2010
language:
Short-container-title:

Author:

Feldman Jon,Henzinger Monika,Korula Nitish,Mirrokni Vahab S.,Stein Cliff

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-15775-2_16

Reference27 articles.

1. Agrawal, S., Wang, Z., Ye, Y.: A dynamic near-optimal algorithm for online linear programming, Working paper posted at http://www.stanford.edu/~yyye/

2. Alaei, S., Malekian, A.: Maximizing sequence-submodular functions (2009) (manuscript)

3. Awerbuch, B., Azar, Y., Plotkin, S.: Throughput-competitive on-line routing. In: FOCS, vol. 34, pp. 32–40 (1993)

4. Lecture Notes in Computer Science;Y. Azar,2008

5. Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: Online auctions and generalized secretary problems. SIGecom Exchanges 7(2) (2008)

Cited by 106 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Efficient Local Search Algorithm for Large GD Advertising Inventory Allocation with Multilinear Constraints;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24

2. A truthful near-optimal mechanism for online linear packing-covering problem in the random order model;Information and Computation;2024-06

3. Online Allocation with Replenishable Budgets: Worst Case and Beyond;Proceedings of the ACM on Measurement and Analysis of Computing Systems;2024-02-16

4. Online Stochastic Allocation of Reusable Resources;2023 62nd IEEE Conference on Decision and Control (CDC);2023-12-13

5. Online Bipartite Matching with Reusable Resources;Mathematics of Operations Research;2023-10-13