Beyond Winner-Take-All Procurement Auctions
Pranav Garimidi, Michael Neuder, Tim Roughgarden

TL;DR
This paper introduces new procurement auction mechanisms that balance cost efficiency with decentralization, addressing issues like concentration and Sybil attacks in blockchain resource procurement.
Contribution
It designs a DSIC mechanism with a tunable parameter to interpolate between winner-take-all and uniform allocations, and proposes two alternative mechanisms to improve robustness and simplicity.
Findings
The DSIC mechanism minimizes social cost with a tunable parameter $\alpha$.
A Tullock contest-based mechanism achieves Sybil-proof procurement.
A proportional payment mechanism is ex-post safe and simpler to implement.
Abstract
Blockchain protocols often seek to procure computationally challenging work from a decentralized set of participants. While there are simple procurement auctions that result in the minimal cost of acquisition and maximal efficiency, they also lead to concentration in the provider set due to the winner-take-all market structure. We design and analyze single-good procurement auctions that balance social-cost minimization (at the extreme, a winner-take-all auction) with decentralization (at the extreme, a uniform allocation). We first give a dominant-strategy incentive-compatible (DSIC) mechanism explicitly designed to implement non-winner-take-all allocations. Our allocation rule uniquely solves an optimization with respect to a modified social-cost metric that penalizes large, single-player concentrations and is parameterized with a curvature value, , with …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
