arXiv · 2410.13960
Approximating Auction Equilibria with Reinforcement Learning
Abstract
Traditional methods for computing equilibria in auctions become computationally intractable as auction complexity increases, particularly in multi-item and dynamic auctions. This paper introduces a self-play based reinforcement learning approach that employs advanced algorithms such as Proximal Policy Optimization and Neural Fictitious Self-Play to approximate Bayes-Nash equilibria. This framework allows for continuous action spaces, high-dimensional information states, and delayed payoffs. Through self-play, these algorithms can learn robust and near-optimal bidding strategies in auctions with known equilibria, including those with symmetric and asymmetric valuations, private and interdependent values, and multi-round auctions.
Explore related subjects
Keep this discovery
Pranjal Rawat. 2024-10-17. Approximating Auction Equilibria with Reinforcement Learning. https://arxiv.org/abs/2410.13960
Cite the original work for its findings. Save a collection to share your selection of sources.