Approximation Schemes for Sequential Posted Pricing in Multi-unit Auctions
暂无分享,去创建一个
Sudipto Guha | Yishay Mansour | S. Muthukrishnan | Tanmoy Chakraborty | Eyal Even-Dar | Y. Mansour | Eyal Even-Dar | S. Guha | S. Muthukrishnan | T. Chakraborty
[1] R. Tyrrell Rockafellar,et al. Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.
[2] Roger B. Myerson,et al. Optimal Auction Design , 1981, Math. Oper. Res..
[3] P. Hall,et al. On the rate of Poisson convergence , 1984, Mathematical Proceedings of the Cambridge Philosophical Society.
[4] Éva Tardos,et al. An approximation algorithm for the generalized assignment problem , 1993, Math. Program..
[5] Sanjeev Khanna,et al. A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem , 2005, SIAM J. Comput..
[6] Uriel Feige,et al. On maximizing welfare when utility functions are subadditive , 2006, STOC '06.
[7] Noam Nisan,et al. Truthful randomized mechanisms for combinatorial auctions , 2006, STOC '06.
[8] Y. Mansour,et al. Item pricing for revenue maximization , 2008, SECO.
[9] Sanjeev Khanna,et al. Dynamic and Non-uniform Pricing Strategies for Revenue Maximization , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[10] Shahar Dobzinski,et al. On the Power of Randomization in Algorithmic Mechanism Design , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[11] Mechanisms for Multi-Unit Auctions , 2014, J. Artif. Intell. Res..
[12] Gagan Goel,et al. Budget constrained auctions with heterogeneous items , 2009, STOC '10.
[13] Sudipto Guha,et al. Selective Call Out and Real Time Bidding , 2010, WINE.
[14] Shuchi Chawla,et al. Multi-parameter mechanism design and sequential posted pricing , 2010, BQGT.
[15] Qiqi Yan,et al. Mechanism design via correlation gap , 2010, SODA '11.
[16] Ashish Goel,et al. Improved approximation results for stochastic knapsack problems , 2011, SODA '11.