Single-Item Auctions with a Monopolist Intermediary

Abstract: Classical optimal auction theory assumes that bids reach the seller directly. We study how this picture changes when a revenue-maximizing intermediary controls access to the seller's auction. Motivated by blockchain auctions, online platforms, and other intermediated markets, we consider a single-item auction with independent private values and a monopolist intermediary who can decide which bidder messages are forwarded to the seller. We establish approximation guarantees and impossibility results across three timing models: seller-first, intermediary-first, and simultaneous. In the seller-first model, arbitrary deterministic seller mechanisms collapse to posted-price mechanisms, and the intermediary's best response is a shifted Myerson auction. This yields a sharp separation: for regular distributions, the seller's revenue can be arbitrarily small relative to the no-intermediary optimum, while for $α$-strongly regular distributions, posted prices recover a constant fraction of the optimum with a tight dependence on $α$. We further show that timing matters: neither Stackelberg order uniformly dominates, and simultaneous play can leave both parties unboundedly worse off than in either sequential model.

• The paper shows that the intermediary’s monopoly power forces seller mechanisms to collapse to posted prices, enabling nearly complete surplus extraction from regular distributions.
• It demonstrates that the auction timing models (seller-first, intermediary-first, simultaneous) yield distinct revenue approximations, with Stackelberg protocols offering robust guarantees under strongly regular distributions.
• The analysis highlights practical implications for digital platforms, blockchain, and ad markets, underscoring the need for regulatory oversight and more resilient auction designs.

Single-Item Auctions with a Monopolist Intermediary: An Expert Analysis

Overview and Motivation

This paper analyzes optimal auction design in the presence of a monopolist intermediary who controls access to a seller's single-item auction, fundamentally modifying the informational and strategic landscape. Traditional single-item auction theory presumes direct communication between bidders and the seller; however, numerous practical settings—including blockchain transaction markets, digital ad platforms, and agentic trade—feature economically-motivated intermediaries that act as access-controlling platforms. The authors model this scenario as a three-agent game (seller, intermediary, and $n$ bidders) and formally investigate how the intermediary's monopoly power reshapes revenue outcomes, optimal mechanisms, and equilibrium properties under alternative timing protocols.

Model Formulation

The setup consists of a single-item auction with $n$ bidders (independent, private values $v_i \sim F_i$), a seller, and a single fully strategic, revenue-maximizing intermediary. The intermediary determines which bidder messages (bids) are forwarded to the seller, and may also extract payment from bidders for this right. All parties' mechanisms are assumed deterministic (with randomization shown to provide no additional revenue gains). Three timing models are examined:

• Seller-First: Seller announces mechanism; intermediary best-responds.
• Intermediary-First: Intermediary announces mechanism; seller best-responds.
• Simultaneous: Mechanism choices are simultaneous; Nash equilibrium analysis.

The array of mechanism choices and equilibrium concepts reveals sharp, nontrivial separations between the achievable revenues of seller and intermediary, depending on both timing order and the class of value distributions.

Seller-First Model: Structural Collapse and Revenue Consequences

A central structural finding is that, under access control by a monopolist intermediary, any deterministic seller mechanism collapses to a posted price, with the optimal strategy for the intermediary being a shifted Myerson auction. Specifically, the intermediary runs a single-item Myerson optimal auction in bidder values shifted down by the seller's posted price $p_0$, with personalized reserves $ϕ_i(p_0) - p_0$ (where $ϕ_i$ is the virtual value function for bidder $i$).

Revenue Approximation and Impossibility Results

• Regular Distributions: Seller's revenue can be made arbitrarily small compared to the no-intermediary optimum, as the intermediary can capture nearly all surplus in pathological instances.
• Strongly Regular Distributions ($\alpha$-strongly regular, $0 < \alpha \leq 1$): Regardless of the intermediary’s best response, an anonymous posted price mechanism achieves a constant-factor approximation to the optimal revenue, with the guarantee parameterized tightly by $c(\alpha) = \alpha^{1/(1-\alpha)}$.
• Randomization: Randomized seller mechanisms yield no additional expected revenue beyond deterministic posted prices, due to the strategic responding power of the intermediary and the structure of single-bidder menu auctions.

Illustrative Instances

The authors construct explicit value distributions where the seller's revenue vanishes as distribution parameters approach certain limits, with the intermediary extracting nearly the entire surplus. This demonstrates the severity of intermediary power and the importance of distributional assumptions for revenue guarantees.

Intermediary-First Model: Reverse Stackelberg Advantage

Inverting the timing, the intermediary first announces its mechanism. The seller, upon observing the induced access probabilities, optimally responds via a posted price. The model is symmetric to the seller-first case regarding the collapse of mechanisms, but the revenue division is reversed:

• Regular Distributions: The intermediary's revenue can now be rendered arbitrarily small for certain distributions, losing the commitment advantage.
• i.i.d. MHR Distributions: A posted price for access guarantees the intermediary a constant-fraction of the optimal revenue. This result leverages the closure of the MHR property under maxima and known lower bounds relating anonymous pricing to optimal revenue.

Thus, commitment order yields first-mover advantages for both players, yet neither Stackelberg order is universally dominant; revenue guarantees and loss are distribution-sensitive.

Simultaneous Model: Nash Equilibria and Non-Robustness

When seller and intermediary select mechanisms simultaneously, the resulting game exhibits highly non-robust, pathological Nash equilibria:

• Multiplicity of Equilibria: With even a single constant-valued bidder, infinitely many Nash equilibria in posted prices exist, with agent strategies interdependent and non-unique.
• Worst-case Revenue: For certain $n$0-strongly regular distributions, the revenues of both seller and intermediary at any Nash equilibrium can be unboundedly worse than those in either Stackelberg model. This demonstrates that simultaneous move protocols cannot guarantee the revenue approximations from sequential models, and equilibrium selection becomes a critical (and problematic) issue.

Implications and Theoretical Significance

This work rigorously formalizes the revenue impact of a monopoly intermediary on single-item auction outcomes and highlights the fragility of optimal auction theory under access-control distortions. The following implications and directions are especially notable:

• Generalizability: The mechanisms analyzed are agnostic to agent identity and extend to non-identical, non-i.i.d. regular value distributions, expanding applicability beyond the classic, symmetric settings.
• Agency and Market Design: The results are directly relevant to blockchain builder-relay architectures (e.g., MEV-Boost, block auction intermediaries), digital advertising platforms, and digital commerce intermediaries—showing how platform power can severely suppress seller revenue or overall welfare.
• Robust Mechanism Design: The demonstrated non-robustness of Nash equilibria suggests strong reasons for favoring Stackelberg-style protocols (with clear commitment), as simultaneous move games are too fragile from a mechanism design perspective. The tightness of revenue approximations for $n$1-strongly regular distributions provides guidance for practical mechanism selection.
• Regulatory Considerations: Monopoly intermediaries with access control may require economic or institutional checks to prevent efficiency and revenue loss, particularly when distributional regularity cannot be guaranteed.

Looking forward, potential directions include generalizing to multi-item settings, analyzing competing intermediaries or partial access control, and designing mechanisms that are robust to intermediary strategic behavior even under limited information.

Conclusion

The paper delivers a rigorous analysis of single-item auctions intermediated by a monopoly platform, delineating sharp structural, algorithmic, and revenue-theoretic consequences. The Stackelberg order between seller and intermediary fundamentally determines attainable revenues, with strong impossibility results for regular distributions and tight approximations under strong regularity. The non-robustness of simultaneous mechanisms underscores the importance of commitment and timing in real-world auction markets featuring strategic, revenue-maximizing intermediaries. These findings both illuminate critical risks for markets increasingly mediated by digital platforms and provide precise guidelines for mechanism design in such environments.