Search arXiv⌕ Search

arXiv · 2501.12591

Optimal Rebate Design: Incentives, Competition and Efficiency in Auction Markets

Abstract

This study explores the design of an efficient rebate policy in auction markets, focusing on a continuous-time setting with competition among market participants. In this model, a stock exchange collects transaction fees from auction investors executing block trades to buy or sell a risky asset, then redistributes these fees as rebates to competing market makers submitting limit orders. Market makers influence both the price at which the asset trades and their arrival intensity in the auction. We frame this problem as a principal-multi-agent problem and provide necessary and sufficient conditions to characterize the Nash equilibrium among market makers. The exchange's optimization problem is formulated as a high-dimensional Hamilton-Jacobi-Bellman equation with Poisson jump processes, which is solved using a verification result. To numerically compute the optimal rebate and transaction fee policies, we apply the Deep BSDE method. Our results show that optimal transaction fees and rebate structures improve market efficiency by narrowing the spread between the auction clearing price and the asset's fundamental value, while ensuring a minimal gain for both market makers indexed on the price of the asset on a coexisting limit order book.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Thibaut Mastrolia, Tianrui Xu. 2026-06-07. Optimal Rebate Design: Incentives, Competition and Efficiency in Auction Markets. https://arxiv.org/abs/2501.12591

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Do Two On-Chain Observation Pipelines See the Same Tokens? Cross-Pipeline Coverage on the Solana pump.fun Launchpad

On-chain studies of memecoin launchpads usually rely on one data-collection pipeline, yet whether differently configured pipelines observe the same tokens is rarely measured. This paper compares the output mint sets of two separately configured pipelines from one research programme on the Solana pump.fun launchpad: a cohort-detection pipeline that flags coordinated early-buyer wallets, and a rejection-filtering pipeline that logs a trader-side observer's pre-trade filter decisions. Two consecutive, non-overlapping windows are analysed (v1: June 2026; v2: June-July 2026); in each, the rejection data are restricted to the interval spanned by the cohort detections under four timestamp rules. Only raw counts, observed proportions and Jaccard/Dice indices are reported. In v2, where the rejection stream covers the whole 17.5-day window, the cohort set contains 623 mints and the rejection set 1,742, with 5 overlapping mints (0.803% of cohort; 0.287% of rejection). In v1 a collection gap means the rejection stream covers only the final 14.25 hours (4.4%) of the 13.4-day cohort window; the 20,162 cohort and 53 rejection mints share 1 mint, and within the covered interval none, a count too small to be informative. Both windows show nearly disjoint outputs, agreeing in direction but not in magnitude. Collector configuration, not only market behaviour, therefore shapes which tokens an on-chain study observes, and the paper proposes reporting cross-collector overlap and collector coverage as a routine check. Data and a script that re-derives every number are openly available.

q-fin.TR↗

The Marginal Effects of Ethereum Network MEV Transaction Re-Ordering

Two MEV builders now produce nearly 80\% of Ethereum blocks. Block builders have the ability to reorder transactions on the blockchain in a way that can be harmful to participants. We estimate participants would pay in the aggregate nearly \$7.2 million per month to guarantee that they remained in the first quartile of the block. Sandwich attacks, in which a transaction is front run, are frequent, averaging more than one every two blocks. Gas fees on these transactions pay for nearly 9.6\% of the MEV payments to the validator. Reforms such as gas fee priority or private transaction pools might be helpful.

q-fin.TR↗

Computable Countermarkets and the Limits of Universal Trading

We explain why no trading algorithm can guarantee profit in every market. For each deterministic program that always returns a finite-precision position, we construct a fixed, algorithmically generated price path on which every active position loses and inactivity earns nothing. This holds with positive, continually changing prices, costless trading, and unlimited computation time. Separate arguments limit learning market rules, certifying future events, and establishing randomness from finite data. Useful strategies may exploit market structure, information, or compensation for risk, while benchmark performance need not imply profit. Reversing and rearranging price histories within the assumed market class provide practical stress tests, distinguishing conditional success from universal guarantees.

q-fin.TR↗