Credible, Truthful, and Two-Round (Optimal) Auctions via Cryptographic Commitments
暂无分享,去创建一个
[1] Nicole Immorlica,et al. Repeated Sales with Multiple Strategic Buyers , 2017, EC.
[2] Xianwen Shi,et al. Auctions with Limited Commitment , 2013, American Economic Review.
[3] Mohammad Akbarpour,et al. Credible Auctions: A Trilemma , 2019, Econometrica.
[4] H. Nurmi,et al. Cryptographic protocols for Vickrey auctions , 1993 .
[5] Oded Goldreich,et al. Foundations of Cryptography: Volume 2, Basic Applications , 2004 .
[6] Jason D. Hartline. Mechanism Design and Approximation , 2014 .
[7] Iddo Bentov,et al. How to Use Bitcoin to Design Fair Protocols , 2014, CRYPTO.
[8] Yang Cai,et al. Extreme-Value Theorems for Optimal Multidimensional Pricing , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[9] M. Hooshmand. Ultra power and ultra exponential functions , 2006 .
[10] Oded Goldreich,et al. The Foundations of Cryptography - Volume 2: Basic Applications , 2001 .
[11] Yuval Peres,et al. Perfect Bayesian Equilibria in Repeated Sales , 2014, SODA.
[12] Richard Cole,et al. The sample complexity of revenue maximization , 2014, STOC.
[13] Roger B. Myerson,et al. Optimal Auction Design , 1981, Math. Oper. Res..
[14] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[15] Richard Cleve,et al. Limits on the security of coin flips when half the processors are faulty , 1986, STOC '86.
[16] Sunju Park,et al. Protocol completion incentive problems in cryptographic Vickrey auctions , 2008, Electron. Commer. Res..
[17] Marc Fischlin,et al. Efficient Non-malleable Commitment Schemes , 2000, Journal of Cryptology.
[18] P. Klemperer. What Really Matters in Auction Design , 2001 .