Fast Algorithms for Computing Interim Allocations in Single-Parameter Environments
暂无分享,去创建一个
[1] Jason D. Hartline. Mechanism Design and Approximation , 2014 .
[2] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .
[3] William Vickrey,et al. Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .
[4] Yang Cai,et al. Optimal Multi-dimensional Mechanism Design: Reducing Revenue to Welfare Maximization , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[5] Roger B. Myerson,et al. Optimal Auction Design , 1981, Math. Oper. Res..
[6] Tim Roughgarden,et al. Public Projects, Boolean Functions, and the Borders of Border's Theorem , 2015, EC.
[7] Edith Elkind,et al. Designing and learning optimal finite support auctions , 2007, SODA '07.
[8] Yang Cai,et al. Understanding Incentives: Mechanism Design Becomes Algorithm Design , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[9] Kim C. Border. IMPLEMENTATION OF REDUCED FORM AUCTIONS: A GEOMETRIC APPROACH , 1991 .
[10] Lars-Gunnar Svensson. Strategy-proof allocation of indivisible goods , 1999 .