Online Budgeted Allocation with General Budgets-Reference-Cited by-同舟云学术

Online Budgeted Allocation with General Budgets

Published:2016-07-21 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2016 ACM Conference on Economics and Computation
language:
Short-container-title:

Author:

Kell Nathaniel¹,Panigrahi Debmalya¹

Affiliation:

1. Duke University, Durham, NC, USA

Funder

Google FacultyResearch Award

National Science Foundation

Yahoo FREP Award

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/2940716.2940770

Reference23 articles.

1. Shalinda Adikari and Kaushik Dutta. 2015. Real Time Bidding in Online Digital Advertisement. In DESRIST. 19--38. 10.1007/978-3-319-18714-3_2 Shalinda Adikari and Kaushik Dutta. 2015. Real Time Bidding in Online Digital Advertisement. In DESRIST. 19--38. 10.1007/978-3-319-18714-3_2

2. Gagan Aggarwal Yang Cai Aranyak Mehta and George Pierrakos. 2014. Biobjective Online Bipartite Matching. In WINE. 218--231. Gagan Aggarwal Yang Cai Aranyak Mehta and George Pierrakos. 2014. Biobjective Online Bipartite Matching. In WINE. 218--231.

3. Gagan Aggarwal Gagan Goel Chinmay Karande and Aranyak Mehta. 2011. Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations. In SODA. 1253--1264. Gagan Aggarwal Gagan Goel Chinmay Karande and Aranyak Mehta. 2011. Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations. In SODA. 1253--1264.

4. Shipra Agrawal and Nikhil R. Devanur. 2015. Fast Algorithms for Online Stochastic Convex Programming. In SODA. 1405--1424. Shipra Agrawal and Nikhil R. Devanur. 2015. Fast Algorithms for Online Stochastic Convex Programming. In SODA. 1405--1424.

5. Baruch Awerbuch Yossi Azar and Serge A. Plotkin. 1993. Throughput-Competitive On-Line Routing. In STOC. 32--40. 10.1109/SFCS.1993.366884 Baruch Awerbuch Yossi Azar and Serge A. Plotkin. 1993. Throughput-Competitive On-Line Routing. In STOC. 32--40. 10.1109/SFCS.1993.366884

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

1. Online Resource Allocation with Personalized Learning;Operations Research;2022-07

2. Inventory Balancing with Online Learning;Management Science;2022-03

3. Online Resource Allocation with Personalized Learning;SSRN Electronic Journal;2020

4. Near optimal algorithms for online weighted bipartite matching in adversary model;Journal of Combinatorial Optimization;2016-12-01