English
Related papers

Related papers: Open vs. Sealed: Auction Format Choice for Maximal…

200 papers

In blockchain systems operating under the Proof-of-Stake (PoS) consensus mechanism, fairness in transaction processing is essential to preserving decentralization and maintaining user trust. However, with the emergence of Maximal…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-01-21 Yitian Wang , Yebo Feng , Yingjiu Li , Jiahua Xu

We provide algorithms that learn simple auctions whose revenue is approximately optimal in multi-item multi-bidder settings, for a wide range of valuations including unit-demand, additive, constrained additive, XOS, and subadditive. We…

Computer Science and Game Theory · Computer Science 2017-09-04 Yang Cai , Constantinos Daskalakis

We provide efficient estimation methods for first- and second-price auctions under independent (asymmetric) private values and partial observability. Given a finite set of observations, each comprising the identity of the winner and the…

Computer Science and Game Theory · Computer Science 2022-05-05 Yeshwanth Cherapanamjeri , Constantinos Daskalakis , Andrew Ilyas , Manolis Zampetakis

We study a setting where agents use no-regret learning algorithms to participate in repeated auctions. \citet{kolumbus2022auctions} showed, rather surprisingly, that when bidders participate in second-price auctions using no-regret bidding…

Computer Science and Game Theory · Computer Science 2024-11-15 Gagan Aggarwal , Anupam Gupta , Andres Perlroth , Grigoris Velegkas

We study auction design in the celebrated interdependence model introduced by Milgrom and Weber [1982], where a mechanism designer allocates a good, maximizing the value of the agent who receives it, while inducing truthfulness using…

Computer Science and Game Theory · Computer Science 2026-03-20 Patrick Loiseau , Simon Mauras , Minrui Xu

The enhanced competition paradigm is an attempt at bridging the gap between simple and optimal auctions. In this line of work, given an auction setting with $m$ items and $n$ bidders, the goal is to find the smallest $n' \geq n$ such that…

Computer Science and Game Theory · Computer Science 2021-05-19 Linda Cai , Raghuvansh R. Saxena

Blockchains offer strong security guarantees, but they cannot protect the ordering of transactions. Powerful players, such as miners, sequencers, and sophisticated bots, can reap significant profits by selectively including, excluding, or…

Cryptography and Security · Computer Science 2023-10-24 Sen Yang , Fan Zhang , Ken Huang , Xi Chen , Youwei Yang , Feng Zhu

In this paper, we take a close look at a problem labeled maximal extractable value (MEV), which arises in a blockchain due to the ability of a block producer to manipulate the order of transactions within a block. Indeed, blockchains such…

General Economics · Economics 2024-03-29 Vijay Mohan , Peyman Khezr

Block space on the blockchain is scarce and must be allocated efficiently through block building. However, Ethereum's current block-building ecosystem, MEV-Boost, has become highly centralized due to integration, which distorts competition,…

Cryptography and Security · Computer Science 2026-02-05 Mengqian Zhang , Sen Yang , Kartik Nayak , Fan Zhang

We study the problem of learning revenue-optimal multi-bidder auctions from samples when the samples of bidders' valuations can be adversarially corrupted or drawn from distributions that are adversarially perturbed. First, we prove tight…

Computer Science and Game Theory · Computer Science 2021-07-14 Wenshuo Guo , Michael I. Jordan , Manolis Zampetakis

In mechanism design, it is challenging to design the optimal auction with correlated values in general settings. Although value distribution can be further exploited to improve revenue, the complex correlation structure makes it hard to…

Computer Science and Game Theory · Computer Science 2023-02-21 Da Huo , Zhilin Zhang , Zhenzhe Zheng , Chuan Yu , Jian Xu , Fan Wu

We construct prior-free auctions with constant-factor approximation guarantees with ordered bidders, in both unlimited and limited supply settings. We compare the expected revenue of our auctions on a bid vector to the monotone price…

Computer Science and Game Theory · Computer Science 2012-12-13 Elias Koutsoupias , Stefano Leonardi , Tim Roughgarden

This Systematization of Knowledge (SoK) provides a comprehensive historical analysis of Maximal Extractable Value (MEV) in blockchain systems, tracing its conceptual evolution through three distinct eras. We organize the fragmented…

Cryptography and Security · Computer Science 2026-03-10 Davide Mancino , Hasret Ozan Sevim

We study the efficiency of sequential first-price item auctions at (subgame perfect) equilibrium. This auction format has recently attracted much attention, with previous work establishing positive results for unit-demand valuations and…

Computer Science and Game Theory · Computer Science 2013-09-11 Michal Feldman , Brendan Lucier , Vasilis Syrgkanis

Maximal Extractable Value (MEV) has garnered significant attention in the cryptocurrency community. Such attention is a consequence of the revenue that can be generated from MEV, as well as the risks MEV poses to the fundamental value…

Information Theory · Computer Science 2023-11-10 Ciaran Hughes

Currently, over 90% of Ethereum blocks are built using MEV-Boost, an auction that allows validators to sell their block-building power to builders who compete in an open English auction in each slot. Shortly after the merge, when MEV-Boost…

Theoretical Economics · Economics 2023-11-16 Mallesh Pai , Max Resnick

We study envy-free pricing mechanisms in matching markets with $m$ items and $n$ budget constrained buyers. Each buyer is interested in a subset of the items on sale, and she appraises at some single-value every item in her preference-set.…

Computer Science and Game Theory · Computer Science 2016-10-31 Riccardo Colini-Baldeschi , Stefano Leonardi , Qiang Zhang

Traditional single-proposer blockchains suffer from miner extractable value (MEV), where validators exploit their serial monopoly on transaction inclusion and ordering to extract rents from users. While there have been many developments at…

Cryptography and Security · Computer Science 2025-09-30 Pranav Garimidi , Joachim Neu , Max Resnick

We study reserve prices in auctions with independent private values when bidders are expectations-based loss averse. We find that the optimal public reserve price excludes fewer bidder types than under risk neutrality. Moreover, we show…

Theoretical Economics · Economics 2023-06-16 Benjamin Balzer , Antonio Rosato

This paper considers prior-independent mechanism design, namely identifying a single mechanism that has near optimal performance on every prior distribution. We show that mechanisms with truthtelling equilibria, a.k.a., revelation…

Computer Science and Game Theory · Computer Science 2018-08-01 Yiding Feng , Jason D. Hartline