Online Stochastic Max-Weight Bipartite Matching: Beyond Prophet Inequalities
暂无分享,去创建一个
Amin Saberi | Christos Papadimitriou | David Wajc | Tristan Pollner | C. Papadimitriou | A. Saberi | David Wajc | Tristan Pollner
[1] A. Toriello,et al. Time-Indexed Relaxations for the Online Bipartite Matching Problem , 2017, 1709.01557.
[2] 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.
[3] T. Hill,et al. Comparisons of Stop Rule and Supremum Expectations of I.I.D. Random Variables , 1982 .
[4] E. Samuel-Cahn. Comparison of Threshold Stop Rules and Maximum for Independent Nonnegative Random Variables , 1984 .
[5] Joan Feigenbaum,et al. Random debaters and the hardness of approximating stochastic functions , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.
[6] Leslie G. Valiant,et al. The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..
[7] K. Joag-dev,et al. Negative Association of Random Variables with Applications , 1983 .
[8] J. Scott Provan,et al. The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..
[9] Ruben Hoeksma,et al. Recent developments in prophet inequalities , 2019, SECO.
[10] Joan Feigenbaum,et al. Random Debaters and the Hardness of Approximating Stochastic Functions , 1997, SIAM J. Comput..
[11] José R. Correa,et al. Posted Price Mechanisms for a Random Stream of Customers , 2017, EC.
[12] Ali Aouad,et al. Dynamic Stochastic Matching Under Limited Time , 2019, EC.
[13] Mohammad Taghi Hajiaghayi,et al. Online prophet-inequality matching with applications to ad allocation , 2012, EC '12.
[14] S. Matthew Weinberg,et al. Matroid prophet inequalities and applications to multi-dimensional mechanism design , 2014, Games Econ. Behav..
[15] Amin Saberi,et al. An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem , 2010, SODA '10.
[16] Desh Ranjan,et al. Balls and bins: A study in negative dependence , 1996, Random Struct. Algorithms.
[17] Michal Feldman,et al. Online Stochastic Max-Weight Matching: Prophet Inequality for Vertex and Edge Arrival Models , 2020, EC.
[18] Danny Segev,et al. Efficient Approximation Schemes for Stochastic Probing and Prophet Problems , 2020, ArXiv.
[19] Shuchi Chawla,et al. Multi-parameter mechanism design and sequential posted pricing , 2010, BQGT.
[20] T. Hill,et al. A Survey of Prophet Inequalities in Optimal Stopping Theory , 1992 .
[21] Amin Saberi,et al. An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem , 2010, SODA '10.
[22] Amin Saberi,et al. Nearly Optimal Pricing Algorithms for Production Constrained and Laminar Bayesian Selection , 2018, EC.
[23] Morteza Zadimoghaddam,et al. Online Stochastic Weighted Matching: Improved Approximation Algorithms , 2011, WINE.
[24] Amin Saberi,et al. Two-stage Stochastic Matching with Application to Ride Hailing , 2021, SODA.
[25] Zvi Galil,et al. Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..
[26] Yuhao Zhang,et al. Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals , 2018, ICALP.
[27] Ola Svensson,et al. Online Matching with General Arrivals , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).
[28] Jian Li,et al. A PTAS for a Class of Stochastic Dynamic Programs , 2018, ICALP.
[29] Amin Saberi,et al. Online stochastic matching: online actions based on offline statistics , 2010, SODA '11.
[30] M. Murty. Ramanujan Graphs , 1965 .
[31] Brendan Lucier,et al. An economic view of prophet inequalities , 2017, SECO.
[32] Paul Dütting,et al. Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs , 2020, SIAM J. Comput..
[33] Mohammad Taghi Hajiaghayi,et al. Automated Online Mechanism Design and Prophet Inequalities , 2007, AAAI.
[34] Amin Saberi,et al. The Greedy Algorithm Is not Optimal for On-Line Edge Coloring , 2021, ICALP.
[35] Nick Gravin,et al. Prophet Inequality for Bipartite Matching: Merits of Being Simple and Non Adaptive , 2019, EC.
[36] Michal Feldman,et al. Combinatorial Auctions via Posted Prices , 2014, SODA.
[37] Christos H. Papadimitriou,et al. Games against nature , 1985, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[38] Sudipto Guha,et al. How to probe for an extreme value , 2010, TALG.
[39] Amin Saberi,et al. The Stationary Prophet Inequality Problem , 2021, ArXiv.
[40] Paul Dütting,et al. An O(log log m) prophet inequality for subadditive combinatorial auctions , 2020, SIGecom Exch..
[41] A. Khursheed,et al. Positive dependence in multivariate distributions , 1981 .
[42] José R. Correa,et al. From pricing to prophets, and back! , 2019, Oper. Res. Lett..
[43] David R. Karger,et al. A randomized fully polynomial time approximation scheme for the all terminal network reliability problem , 1995, STOC '95.
[44] Aranyak Mehta,et al. Online bipartite matching with unknown distributions , 2011, STOC '11.
[45] Ola Svensson,et al. Online Contention Resolution Schemes , 2015, SODA.
[46] Mohammad Taghi Hajiaghayi,et al. Beating 1-1/e for ordered prophets , 2017, STOC.
[47] J. Sethuraman,et al. On Optimal Ordering in the Optimal Stopping Problem , 2019, EC.
[48] Jason D. Hartline. Approximation in mechanism design , 2010, BQGT.
[49] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[50] Wei Chen,et al. Combinatorial Multi-Armed Bandit with General Reward Functions , 2016, NIPS.
[51] Mohammad Mahdian,et al. Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs , 2011, STOC '11.