Prior independent mechanisms via prophet inequalities with limited information
暂无分享,去创建一个
S. Matthew Weinberg | Robert D. Kleinberg | Robert Kleinberg | Pablo Daniel Azar | S. Weinberg | Pablo Azar
[1] William Vickrey,et al. Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .
[2] Roger B. Myerson,et al. Optimal Auction Design , 1981, Math. Oper. Res..
[3] S. Hart,et al. Maximal revenue with multiple goods: Nonmonotonicity and other observations , 2015 .
[4] Tim Roughgarden,et al. Supply-limiting mechanisms , 2012, EC '12.
[5] Martin Pál,et al. Algorithms for Secretary Problems on Graphs and Hypergraphs , 2008, ICALP.
[6] Oded Lachish,et al. O(log log Rank) Competitive Ratio for the Matroid Secretary Problem , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[7] E. H. Clarke. Multipart pricing of public goods , 1971 .
[8] Christos Tzamos,et al. The Complexity of Optimal Mechanism Design , 2012, SODA.
[9] W. Feller,et al. An Introduction to Probability Theory and Its Applications, Vol. 1 , 1967 .
[10] Theodore Groves,et al. Incentives in Teams , 1973 .
[11] Noam Nisan,et al. The menu-size complexity of auctions , 2013, EC '13.
[12] Tim Roughgarden,et al. Revenue maximization with a single sample , 2010, EC '10.
[13] U. Krengel,et al. Semiamarts and finite values , 1977 .
[14] Shuchi Chawla,et al. The power of randomness in Bayesian optimal mechanism design , 2015, Games Econ. Behav..
[15] C. Greg Plaxton,et al. Competitive Weighted Matching in Transversal Matroids , 2008, Algorithmica.
[16] Tengyu Ma,et al. The Simulated Greedy Algorithm for Several Submodular Matroid Secretary Problems , 2011, Theory of Computing Systems.
[17] Éva Tardos,et al. Truthful mechanisms for one-parameter agents , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[18] Yang Cai,et al. A duality-based unified approach to Bayesian mechanism design , 2016, SECO.
[19] Jeremy I. Bulow,et al. Auctions versus Negotiations , 1996 .
[20] S. Matthew Weinberg,et al. Optimal and Efficient Parametric Auctions , 2013, SODA.
[21] E. Samuel-Cahn. Comparison of Threshold Stop Rules and Maximum for Independent Nonnegative Random Variables , 1984 .
[22] Ola Svensson,et al. A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem , 2015, SODA.
[23] Nicole Immorlica,et al. Matroids, secretary problems, and online mechanisms , 2007, SODA '07.
[24] S. Matthew Weinberg,et al. Matroid prophet inequalities , 2012, STOC '12.
[25] José A. Soto,et al. Matroid secretary problem in the random assignment model , 2010, SODA '11.
[26] Alejandro M. Manelli,et al. Multidimensional Mechanism Design: Revenue Maximization and the Multiple-Good Monopoly , 2004, J. Econ. Theory.
[27] 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.
[28] Nikhil R. Devanur,et al. Prior-Independent Multi-parameter Mechanism Design , 2011, WINE.
[29] Tim Roughgarden,et al. Simple versus optimal mechanisms , 2009, SECO.
[30] Jan Vondrák,et al. On Variants of the Matroid Secretary Problem , 2011, ESA.
[31] Martin Hoefer,et al. Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods , 2013, ICALP.
[32] Qiqi Yan,et al. Mechanism design via correlation gap , 2010, SODA '11.
[33] Jason D. Hartline,et al. Multi-parameter mechanism design and sequential posted pricing , 2009, STOC '10.
[34] Berthold Vöcking,et al. An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions , 2013, ESA.
[35] Nicole Immorlica,et al. A Knapsack Secretary Problem with Applications , 2007, APPROX-RANDOM.
[36] T. Hill,et al. Stop rule inequalities for uniformly bounded sequences of random variables , 1983 .
[37] Christos Tzamos,et al. Strong Duality for a Multiple-Good Monopolist , 2014, EC.
[38] Robert D. Kleinberg. A multiple-choice secretary algorithm with applications to online auctions , 2005, SODA '05.