Bi-Objective Online Matching and Submodular Allocations
暂无分享,去创建一个
Vahab S. Mirrokni | Hossein Esfandiari | Nitish Korula | Nitish Korula | V. Mirrokni | Hossein Esfandiari
[1] Mihalis Yannakakis,et al. On the approximability of trade-offs and optimal access of Web sources , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[2] Joseph Naor,et al. Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue , 2007, ESA.
[3] Morteza Zadimoghaddam,et al. Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order , 2015, STOC.
[4] Jon Feldman,et al. Online Stochastic Packing Applied to Display Ad Allocation , 2010, ESA.
[5] Sergei Vassilvitskii,et al. Optimal online assignment with forecasts , 2010, EC '10.
[6] Bo Tan,et al. Online Advertisement, Optimization and Stochastic Networks , 2010, IEEE Transactions on Automatic Control.
[7] Aranyak Mehta,et al. AdWords and Generalized On-line Matching , 2005, FOCS.
[8] Aranyak Mehta,et al. Biobjective Online Bipartite Matching , 2014, WINE.
[9] Jon Feldman,et al. Online Ad Assignment with Free Disposal , 2009, WINE.
[10] Thomas P. Hayes,et al. The adwords problem: online keyword matching with budgeted bidders under random permutations , 2009, EC '09.
[11] Daniel Lehmann,et al. Combinatorial auctions with decreasing marginal utilities , 2001, EC '01.
[12] Morteza Zadimoghaddam,et al. Simultaneous approximations for adversarial and stochastic online budgeted allocation , 2012, SODA.
[13] Morteza Zadimoghaddam,et al. Bicriteria Online Matching: Maximizing Weight and Cardinality , 2013, WINE.
[14] Daniel Lehmann,et al. Combinatorial auctions with decreasing marginal utilities , 2001, EC '01.
[15] Vahab S. Mirrokni,et al. Online Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models , 2015, EC.
[16] Jan Vondrák,et al. Optimal approximation for the submodular welfare problem in the value oracle model , 2008, STOC.
[17] Rishabh K. Iyer,et al. Mixed Robust/Average Submodular Partitioning: Fast Algorithms, Guarantees, and Applications , 2015, NIPS.
[18] Mohammad Mahdian,et al. Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs , 2011, STOC '11.
[19] Zizhuo Wang,et al. A Dynamic Near-Optimal Algorithm for Online Linear Programming , 2009, Oper. Res..
[20] Jan Vondrák,et al. Online Submodular Welfare Maximization: Greedy is Optimal , 2012, SODA.
[21] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[22] Nikhil R. Devanur,et al. Near optimal online algorithms and fast approximation algorithms for resource allocation problems , 2011, EC '11.
[23] Vahab S. Mirrokni,et al. Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions , 2008, EC '08.
[24] Mihalis Yannakakis,et al. Approximation of Multiobjective Optimization Problems , 2001, WADS.
[25] Nikhil R. Devanur,et al. Whole-page optimization and submodular welfare maximization with online bidders , 2013, EC '13.
[26] Vivek F. Farias,et al. Model Predictive Control for Dynamic Resource Allocation , 2012, Math. Oper. Res..