English

Optimal Auctions through Deep Learning: Advances in Differentiable Economics

Computer Science and Game Theory 2022-10-17 v6 Artificial Intelligence Machine Learning

Abstract

Designing an incentive compatible auction that maximizes expected revenue is an intricate task. The single-item case was resolved in a seminal piece of work by Myerson in 1981, but more than 40 years later a full analytical understanding of the optimal design still remains elusive for settings with two or more items. In this work, we initiate the exploration of the use of tools from deep learning for the automated design of optimal auctions. We model an auction as a multi-layer neural network, frame optimal auction design as a constrained learning problem, and show how it can be solved using standard machine learning pipelines. In addition to providing generalization bounds, we present extensive experimental results, recovering essentially all known solutions that come from the theoretical analysis of optimal auction design problems and obtaining novel mechanisms for settings in which the optimal mechanism is unknown.

Keywords

Cite

@article{arxiv.1706.03459,
  title  = {Optimal Auctions through Deep Learning: Advances in Differentiable Economics},
  author = {Paul Dütting and Zhe Feng and Harikrishna Narasimhan and David C. Parkes and Sai Srivatsa Ravindranath},
  journal= {arXiv preprint arXiv:1706.03459},
  year   = {2022}
}

Comments

An extended abstract appeared in ICML'19, along with a short Research Highlight in the Communications of the ACM

R2 v1 2026-06-22T20:15:35.191Z