Search Results

Documents authored by Sarenche, Roozbeh


Document
Towards Decentralized Searcher Competition in MEV Markets

Authors: Roozbeh Sarenche and Yunwen Liu

Published in: LIPIcs, Volume 395, 8th Conference on Advances in Financial Technologies (AFT 2026)


Abstract
Centralization in maximal extractable value (MEV) markets is a significant concern for blockchain systems, as persistent concentration of economic power can weaken competition, reduce openness, and undermine the decentralization goals of permissionless protocols. While much of the existing analysis has focused on builders, validators, and block-building markets, this paper studies centralization from the perspective of searcher competition. We develop a heterogeneous model in which searchers differ in opportunity coverage and execution efficiency, and we analyze how auction design affects fairness, decentralization, and security among searchers competing for the same MEV opportunity. To evaluate searcher competition, we introduce two metrics: a Shapley-weighted Jain fairness index, which measures whether rewards are proportional to searchers' marginal contributions, and an expected-reward Herfindahl-Hirschman Index (HHI), which measures concentration in long-run searcher rewards. Using these metrics, we first analyze the standard first-price, winner-take-all auction as a benchmark. Our analysis shows that, under searcher heterogeneity, first-price competition can reward rank dominance rather than marginal contribution, leading to concentrated rewards and weaker contribution-adjusted fairness. Motivated by these limitations, we propose an entry-filtered Shapley-capped auction mechanism that distributes searcher rewards more fairly and broadly among admitted high-quality submissions. Designing such a mechanism in a permissionless blockchain environment is challenging: searchers may create Sybil identities by submitting copied or degraded versions of the same execution strategy, and validators may collude with searchers to increase joint payoff. We address these concerns through Bayesian security constraints for copied-code Sybil deviations and validator-searcher coalition deviations, and show that suitable parameter choices make the Shapley-capped mechanism secure against both. We complement the theoretical analysis with numerical benchmarks and Ethereum on-chain data. The theoretical benchmarks show that the proposed mechanism is especially effective in centralized opportunity classes, where first-price competition concentrates rewards among a small set of searchers. They further indicate that the proposed mechanism is a potential improvement over first-price competition in empirically motivated opportunity types.

Cite as

Roozbeh Sarenche and Yunwen Liu. Towards Decentralized Searcher Competition in MEV Markets. In 8th Conference on Advances in Financial Technologies (AFT 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 395, pp. 21:1-21:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)


Copy BibTex To Clipboard

@InProceedings{sarenche_et_al:LIPIcs.AFT.2026.21,
  author =	{Sarenche, Roozbeh and Liu, Yunwen},
  title =	{{Towards Decentralized Searcher Competition in MEV Markets}},
  booktitle =	{8th Conference on Advances in Financial Technologies (AFT 2026)},
  pages =	{21:1--21:24},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-451-2},
  ISSN =	{1868-8969},
  year =	{2026},
  volume =	{395},
  editor =	{Kiayias, Aggelos and Kyropoulou, Maria},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AFT.2026.21},
  URN =		{urn:nbn:de:0030-drops-278750},
  doi =		{10.4230/LIPIcs.AFT.2026.21},
  annote =	{Keywords: Maximal extractable value, MEV, searcher competition, mechanism design, Sybil resistance, Shapley value, reward decentralization}
}

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail