Matroid prophet inequalities and applications to multi-dimensional mechanism design
暂无分享,去创建一个
[1] U. Krengel,et al. Semiamarts and finite values , 1977 .
[2] Peng Shi,et al. Approximation algorithms for restless bandit problems , 2007, JACM.
[3] Ashish Goel,et al. The ratio index for budgeted learning, with applications , 2008, SODA.
[4] Patrick Jaillet,et al. Advances on Matroid Secretary Problems: Free Order Model and Laminar Case , 2012, IPCO.
[5] D. P. Kennedy. Optimal Stopping of Independent Random Variables and Maximizing Prophets , 1985 .
[6] Jan Vondrák,et al. On Variants of the Matroid Secretary Problem , 2011, ESA.
[7] Qiqi Yan,et al. Mechanism design via correlation gap , 2010, SODA '11.
[8] Nicole Immorlica,et al. Matroids, secretary problems, and online mechanisms , 2007, SODA '07.
[9] R. P. Kertz. Comparison of optimal value and constrained maxima expectations for independent random variables , 1986 .
[10] Michael Dinitz,et al. Matroid Secretary for Regular and Decomposable Matroids , 2012, SIAM J. Comput..
[11] Jason D. Hartline,et al. Multi-parameter mechanism design and sequential posted pricing , 2009, STOC '10.
[12] Sudipto Guha,et al. Multi-armed Bandits with Metric Switching Costs , 2009, ICALP.
[13] Martin Pál,et al. Algorithms for Secretary Problems on Graphs and Hypergraphs , 2008, ICALP.
[14] E. Samuel-Cahn. Comparison of Threshold Stop Rules and Maximum for Independent Nonnegative Random Variables , 1984 .
[15] Jason D. Hartline. Approximation in mechanism design , 2010, BQGT.
[16] José A. Soto,et al. Matroid secretary problem in the random assignment model , 2010, SODA '11.
[17] C. Greg Plaxton,et al. Competitive Weighted Matching in Transversal Matroids , 2008, ICALP.
[18] 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.
[19] Sourav Chakraborty,et al. Improved competitive ratio for the matroid secretary problem , 2012, SODA.
[20] T. Hill,et al. A Survey of Prophet Inequalities in Optimal Stopping Theory , 1992 .
[21] Jan Vondrák,et al. Approximating the stochastic knapsack problem: the benefit of adaptivity , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[22] Roger B. Myerson,et al. Optimal Auction Design , 1981, Math. Oper. Res..
[23] D. P. Kennedy. Prophet-type inequalities for multi-choice optimal stopping , 1987 .