IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2603.16333.html

Open vs. Sealed: Auction Format Choice for Maximal Extractable Value

Author

Listed:
  • Aleksei Adadurov
  • Sergey Barseghyan
  • Anton Chtepine
  • Antero Eloranta
  • Andrei Sebyakin
  • Arsenii Valitov

Abstract

We study optimal auction design for Maximum Extractable Value (MEV) auction markets on Ethereum. Using a dataset of 2.2 million transactions across three major orderflow providers, we establish three empirical regularities: extracted values follow a log-normal distribution with extreme right-tail concentration, competition intensity varies substantially across MEV types, and the standard Revenue Equivalence Theorem breaks down due to affiliation among searchers' valuations. We model this affiliation through a Gaussian common factor, deriving equilibrium bidding strategies and expected revenues for five auction formats, first-price sealed-bid, second-price sealed-bid, English, Dutch, and all-pay, across a fine grid of bidder counts $n$ and affiliation parameters $\rho$. Our simulations confirm the Milgrom-Weber linkage principle: English and second-price sealed-bid auctions strictly dominate Dutch and first-price sealed-bid formats for any $\rho > 0$, with a linkage gap of 14-28\% at moderate affiliation ($\rho=0.5$) and up to 30\% for small bidder counts. Applied to observed bribe totals, this gap corresponds to \$10-18 million in foregone revenue over the sample period. We also document a novel non-monotonicity: at large $n$ and high $\rho$, revenue peaks in the interior of the affiliation parameter space and declines thereafter, as near-perfect correlation collapses the order-statistic spread that drives competitive payments.

Suggested Citation

  • Aleksei Adadurov & Sergey Barseghyan & Anton Chtepine & Antero Eloranta & Andrei Sebyakin & Arsenii Valitov, 2026. "Open vs. Sealed: Auction Format Choice for Maximal Extractable Value," Papers 2603.16333, arXiv.org.
  • Handle: RePEc:arx:papers:2603.16333
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2603.16333
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2603.16333. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.