Prophet Inequality for Bipartite Matching: Merits of Being Simple and Non Adaptive
暂无分享,去创建一个
[1] Saeed Alaei,et al. Bayesian Combinatorial Auctions: Expanding Single Buyer Mechanisms to Many Buyers , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[2] Aranyak Mehta,et al. Online budgeted matching in random input models with applications to Adwords , 2008, SODA '08.
[3] Aranyak Mehta,et al. Online Stochastic Matching: Beating 1-1/e , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[4] S. Matthew Weinberg,et al. Matroid prophet inequalities , 2012, STOC '12.
[5] Aranyak Mehta,et al. Online bipartite matching with unknown distributions , 2011, STOC '11.
[6] Yuhao Zhang,et al. Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model , 2019, SODA.
[7] T. Hill,et al. A Survey of Prophet Inequalities in Optimal Stopping Theory , 1992 .
[8] S. Matthew Weinberg,et al. Prophet Inequalities with Limited Information , 2013, SODA.
[9] Paul Dütting,et al. Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Non-Stochastic Inputs , 2016, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[10] Andrew McGregor,et al. Finding Graph Matchings in Data Streams , 2005, APPROX-RANDOM.
[11] U. Krengel,et al. Semiamarts and finite values , 1977 .
[12] SaberiAmin,et al. AdWords and generalized online matching , 2007 .
[13] Sundar Vishwanathan,et al. On Randomized Algorithms for Matching in the Online Preemptive Model , 2015, ESA.
[14] Amos Fiat,et al. The Invisible Hand of Dynamic Market Pricing , 2015, EC.
[15] Morteza Zadimoghaddam,et al. Simultaneous approximations for adversarial and stochastic online budgeted allocation , 2012, SODA.
[16] Itai Ashlagi,et al. Maximizing Efficiency in Dynamic Matching Markets , 2018, ArXiv.
[17] Gagan Goel,et al. Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations , 2010, SODA.
[18] Niv Buchbinder,et al. Online Algorithms for Maximum Cardinality Matching with Edge Arrivals , 2017, ESA.
[19] Aviad Rubinstein,et al. Beyond matroids: secretary problem and prophet inequality with general constraints , 2016, STOC.
[20] R. P. Kertz. Comparison of optimal value and constrained maxima expectations for independent random variables , 1986 .
[21] D. P. Kennedy. Optimal Stopping of Independent Random Variables and Maximizing Prophets , 1985 .
[22] Aviad Rubinstein,et al. Sorting from Noisier Samples , 2017, SODA.
[23] Paul Dütting,et al. Polymatroid Prophet Inequalities , 2013, ESA.
[24] Leah Epstein,et al. Improved Bounds for Online Preemptive Matching , 2012, STACS.
[25] Mohammad Mahdian,et al. Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs , 2011, STOC '11.
[26] E. Samuel-Cahn. Comparison of Threshold Stop Rules and Maximum for Independent Nonnegative Random Variables , 1984 .
[27] Shuchi Chawla,et al. Algorithmic pricing via virtual valuations , 2007, EC '07.
[28] Amos Fiat,et al. Makespan Minimization via Posted Prices , 2017, EC.
[29] Michal Feldman,et al. Combinatorial Auctions via Posted Prices , 2014, SODA.
[30] José R. Correa,et al. From pricing to prophets, and back! , 2019, Oper. Res. Lett..
[31] Yuhao Zhang,et al. How to match when all vertices arrive online , 2018, STOC.
[32] Joseph Naor,et al. Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue , 2007, ESA.
[33] Mohammad Taghi Hajiaghayi,et al. The Online Stochastic Generalized Assignment Problem , 2013, APPROX-RANDOM.
[34] Shuchi Chawla,et al. Multi-parameter mechanism design and sequential posted pricing , 2010, BQGT.
[35] Amin Saberi,et al. Online stochastic matching: online actions based on offline statistics , 2010, SODA '11.
[36] Mohammad Taghi Hajiaghayi,et al. Online prophet-inequality matching with applications to ad allocation , 2012, EC '12.
[37] Nikhil R. Devanur,et al. Near optimal online algorithms and fast approximation algorithms for resource allocation problems , 2011, EC '11.
[38] Mohammad Taghi Hajiaghayi,et al. Automated Online Mechanism Design and Prophet Inequalities , 2007, AAAI.
[39] Richard M. Karp,et al. An optimal algorithm for on-line bipartite matching , 1990, STOC '90.
[40] Morteza Zadimoghaddam,et al. Online Stochastic Weighted Matching: Improved Approximation Algorithms , 2011, WINE.
[41] Ola Svensson,et al. Online Contention Resolution Schemes , 2015, SODA.
[42] Thomas P. Hayes,et al. The adwords problem: online keyword matching with budgeted bidders under random permutations , 2009, EC '09.
[43] D. P. Kennedy. Prophet-type inequalities for multi-choice optimal stopping , 1987 .
[44] Amos Fiat,et al. Pricing Online Decisions: Beyond Auctions , 2015, SODA.