When Bidders Are DAOs

Maryam Bahrani, Pranav Garimidi, Tim Roughgarden

TL;DR

This paper introduces a formal "two-level" framework for auctions where bidders are not individuals, but Decentralized Autonomous Organizations (DAOs). The authors prove that the internal dynamics required to keep DAO members truthful inevitably lead to a logarithmic loss in social welfare ($H_\ell \approx \ln \ell$) for single-item auctions, and they show that for more complex "unit-demand" scenarios, achieving any meaningful welfare approximation is theoretically impossible.

What Problem Does This Paper Address?

In the wake of events like ConstitutionDAO, where thousands of individuals pooled $47 million to bid on a copy of the U.S. Constitution, it has become clear that the "bidder" in modern auctions is often a collective entity.

Standard auction theory assumes bidders are single, rational agents. However, a DAO is a group of individuals who must coordinate: they need to aggregate their private valuations into a single group bid and then decide how to split the bill if they win. Currently, auctioneers (like Sotheby’s) treat DAOs as "black boxes."

The authors ask: Can we design a "two-level" mechanism—an outer auction for the groups and an inner mechanism for the DAO members—that is Incentive Compatible (no one has a reason to lie about their value) and Welfare Optimal (the items go to the people who value them most)?

Methods

The researchers model the problem as a two-level mechanism:

  1. Upper-Level: An auctioneer who sees only group bids and decides which group wins and how much they pay.
  2. Lower-Level: The DAO’s internal logic, consisting of an aggregation function (turning member bids into one group bid) and a cost-sharing rule (distributing the auctioneer's charge among members).

The authors focus on Dominant-Strategy Incentive-Compatibility (DSIC), meaning every individual member’s best move is to bid their true value, regardless of what others do. They utilize tools from algorithmic mechanism design and cost-sharing theory to prove bounds on what is mathematically possible within this framework.

Datasets

Not discussed in the paper. This is a theoretical work based on mathematical proofs and game-theoretic modeling; no empirical datasets or simulations were used.

Key Insights and Ideas

  • The Price of Privacy/Autonomy: Because the auctioneer is "oblivious" to the DAO's internal structure, the DAO must compress its members' complex preferences into a single number. This "information bottleneck" is the primary driver of welfare loss.
  • Truthfulness Requires Exclusion: To prevent "free-riders" (members who value the item but underbid hoping others will pay), a truthful DAO must be able to exclude low-bidding members from using the item, even if the item is technically a "public good" within the group (like a piece of land or a digital asset).
  • Composition Failure: A surprising insight is that "truthful mechanisms don't compose." You can have a perfectly truthful auction (like a Vickrey auction) and a perfectly truthful internal cost-sharing rule, but when you put them together, the resulting system can still be easily manipulated by members.
  • The Unit-Demand Disaster: In settings where bidders want only one of several items (unit-demand), the auctioneer cannot distinguish between a single wealthy bidder and a group of many people with diverse interests. To remain truthful, the mechanism is forced to make sub-optimal allocations, leading to a total breakdown in welfare efficiency.

Key Results

  • Single-Item Auctions: The authors find a "matching" result. They prove a lower bound showing no truthful mechanism can guarantee better than an $H_\ell$-approximation of social welfare (where $H_\ell$ is the $\ell$-th Harmonic number, roughly $\ln \ell$, and $\ell$ is the max group size). They then provide Mechanism 1, which actually achieves this bound.
  • Additive Valuations: If members simply sum their values for multiple items, the $H_\ell$ result scales linearly.
  • Unit-Demand Valuations: The news is much worse here. The authors prove that no truthful two-level mechanism can do better than an $n$-approximation (where $n$ is the total number of bidders). In mechanism design terms, this is a "negative result"—it means the mechanism is essentially no better than just picking a group at random.

Limitations and Future Work

  • Deterministic Focus: The paper focuses on deterministic mechanisms. The authors suggest that randomized mechanisms might potentially offer better welfare guarantees.
  • Oblivious Auctioneers: The model assumes the auctioneer cannot or will not look inside the DAO. If future auction platforms are designed to be "DAO-aware" (e.g., by interacting directly with the DAO's smart contract), the welfare bounds might improve.
  • Valuation Complexity: The study is limited to additive and unit-demand valuations. Real-world DAO preferences (like combinatorial interests) remain unexplored territory.

Summary updated

BibTeX
@inproceedings{bahrani2023when,
  author = {Maryam Bahrani and Pranav Garimidi and Tim Roughgarden},
  title = {{When Bidders Are DAOs}},
  booktitle = {AFT},
  year = {2023},
  doi = {10.4230/lipics.aft.2023.21},
}
Figure