Shill-Proof Auctions (2404.00475v2)
Abstract: In an auction, a seller may masquerade as one or more bidders in order to manipulate the clearing price. We characterize single-item auction formats that are shill-proof in the sense that a profit-maximizing seller has no incentive to submit shill bids. We distinguish between strong shill-proofness, in which a seller with full knowledge of bidders' valuations can never profit from shilling, and weak shill-proofness, which requires only that the expected equilibrium profit from shilling is nonpositive. The Dutch auction (with a suitable reserve) is the unique (revenue-)optimal and strongly shill-proof auction. Moreover, the Dutch auction (with no reserve) is the unique prior-independent auction that is both efficient and weakly shill-proof. While there are multiple ex-post incentive compatible, weakly shill-proof, and optimal auctions; any optimal auction can satisfy only two properties in the set {static, ex-post incentive compatible, weakly shill-proof}.
- Credible auctions: A trilemma. Econometrica 88(2), 425–467.
- Ashlagi, I. and Y. A. Gonczarowski (2018). Stable matching mechanisms are not obviously strategy-proof. Journal of Economic Theory 177, 405–425.
- The lovely but lonely Vickrey auction, pp. 22–26.
- Centralization in block building and proposer-builder separation. arXiv:2401.12120.
- StableFees: A predictable fee market for cryptocurrencies. Management Science 69(11), 6508–6524.
- Auctions with shill bidding. Economic Theory 24, 271–287.
- How serious is shill bidding in online auctions? Evidence from eBay motors. Working Paper.
- Credible, optimal auctions via blockchains.
- Foundations of transaction fee mechanism design. In Proceedings of the 34th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 3856–3899.
- Core-selecting package auctions. International Journal of Game Theory 36, 393–407.
- Revenue maximization with a single sample. Games and Economic Behavior 91, 318–333.
- Elkind, E. (2007). Designing and learning optimal finite support auctions. In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 736–745. SIAM.
- Credible, strategyproof, optimal, and bounded expected-round single-item auctions for all distributions.
- Ferreira, M. V. X. and S. M. Weinberg (2020). Credible, truthful, and two-round (optimal) auctions via cryptographic commitments. In Proceedings of the 21st ACM Conference on Economics and Computation, pp. 683–712.
- When speed is of essence: Perishable goods auctions. Working Paper.
- Contextually private mechanisms. arXiv:2112.10812.
- Izmalkov, S. (2004). Shill bidding and optimal auctions. MIT working paper.
- Lamy, L. (2009). The shill bidding effect versus the linkage principle. Journal of Economic Theory 144(1), 390–413.
- Redesigning Bitcoin’s fee market. ACM Transactions on Economics and Computation 10(1), Art. 5.
- Li, S. (2017). Obviously strategy-proof mechanisms. American Economic Review 107(11), 3257–3287.
- Mackenzie, A. (2020). A revelation principle for obviously strategy-proof implementation. Games and Economic Behavior 124, 512–533.
- Menu mechanisms. Journal of Economic Theory 204, 105511.
- Designing the US incentive auction, pp. 803–812. Cambridge University Press.
- Milgrom, P. R. and R. J. Weber (1982). A theory of auctions and competitive bidding. Econometrica 50(5), 1089–1122.
- Myerson, R. B. (1981). Optimal auction design. Mathematics of Operations Research 6(1), 58–73.
- On cheating in sealed-bid auctions. Decision Support Systems 39(1), 41–54.
- Roughgarden, T. (2021). Transaction fee mechanism design. ACM SIGecom Exchanges 19(1), 52–55.
- Vickrey, W. (1961). Counterspeculation, auctions, and competitive sealed tenders. Journal of Finance 16(1), 8–37.