REVIEW 2 cited by
Optimal Rebate Design: Incentives, Competition and Efficiency in Auction Markets
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original 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.
Forward citations
Cited by 2 Pith papers
-
Regulation or Competition:Major-Minor Optimal Liquidation across Dark and Lit Pools
A dynamic make-take fee and compensation scheme is constructed for optimal liquidation across lit and dark pools and is claimed to reduce market impact relative to a competitive major-minor market.
-
Learning Market Making with Closing Auctions
A neural-fitted Q-learning market maker that anticipates the closing auction beats Avellaneda-Stoikov and TWAP benchmarks on mean returns in the paper's simulations.
Discussion (0). Continue with ORCID to comment.