暂无分享,去创建一个
[1] U. Krengel,et al. Semiamarts and finite values , 1977 .
[2] Roger B. Myerson,et al. Optimal Auction Design , 1981, Math. Oper. Res..
[3] E. Samuel-Cahn. Comparison of Threshold Stop Rules and Maximum for Independent Nonnegative Random Variables , 1984 .
[4] D. P. Kennedy. Optimal Stopping of Independent Random Variables and Maximizing Prophets , 1985 .
[5] R. P. Kertz. Comparison of optimal value and constrained maxima expectations for independent random variables , 1986 .
[6] D. P. Kennedy. Prophet-type inequalities for multi-choice optimal stopping , 1987 .
[7] M. R. Rao,et al. Combinatorial Optimization , 1992, NATO ASI Series.
[8] Jan Vondrák,et al. Approximating the stochastic knapsack problem: the benefit of adaptivity , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[9] Mohammad Taghi Hajiaghayi,et al. Automated Online Mechanism Design and Prophet Inequalities , 2007, AAAI.
[10] Nicole Immorlica,et al. Matroids, secretary problems, and online mechanisms , 2007, SODA '07.
[11] Martin Pál,et al. Algorithms for Secretary Problems on Graphs and Hypergraphs , 2008, ICALP.
[12] Sudipto Guha,et al. Multi-armed Bandits with Metric Switching Costs , 2009, ICALP.
[13] Ashish Goel,et al. The ratio index for budgeted learning, with applications , 2008, SODA.
[14] C. Greg Plaxton,et al. Competitive Weighted Matching in Transversal Matroids , 2008, Algorithmica.
[15] Peng Shi,et al. Approximation algorithms for restless bandit problems , 2007, JACM.
[16] Shuchi Chawla,et al. Multi-parameter mechanism design and sequential posted pricing , 2010, BQGT.
[17] 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.
[18] José A. Soto,et al. Matroid secretary problem in the random assignment model , 2010, SODA '11.
[19] Sourav Chakraborty,et al. Improved competitive ratio for the matroid secretary problem , 2012, SODA.
[20] Jan Vondrák,et al. On Variants of the Matroid Secretary Problem , 2013, Algorithmica.