1. SANDHOLM T, GILPIN A. Sequences of take-it-or-leave-it offers: Near-optimal auctions without full valuation revelation [C]//Fifth international Joint Conference on Autonomous Agents and Multiagent Systems. Hakodate: ACM, 2006: 1127–1134.
2. BLUMROSEN L, HOLENSTEIN T. Posted prices vs. negotiations: An asymptotic analysis [C]//9th ACM Conference on Electronic Commerce. Chicago: ACM, 2008: 49.
3. MORGENSTERN J, ROUGHGARDEN T. On the pseudo-dimension of nearly optimal auctions [M]//Advances in neural information processing systems 28. Red Hook: Curran Associates, Inc., 2015: 136–144.
4. MORGENSTERN J, ROUGHGARDEN T. Learning simple auctions [C]//29th Conference on Learning Theory. New York: Columbia University, 2016: 1298–1318.
5. XIAO T, LIU Z, HUANG W. On the complexity of sequential posted pricing [C]//19th International Conference on Autonomous Agents and Multiagent Systems. Auckland: IFAAMAS, 2020: 1521–1529.