Efficiency of the First-Price Auction in the Autobidding World

Abstract

We study the price of anarchy of first-price auctions in the autobidding world, where bidders can be either utility maximizers (i.e., traditional bidders) or value maximizers (i.e., autobidders). We show that with autobidders only, the price of anarchy of first-price auctions is $1/2$, and with both kinds of bidders, the price of anarchy degrades to about $0.457$ (the precise number is given by an optimization). These results complement the recent result by [Jin and Lu, 2022] showing that the price of anarchy of first-price auctions with traditional bidders is $1 - 1/e^2$. We further investigate a setting where the seller can utilize machine-learned advice to improve the efficiency of the auctions. There, we show that as the accuracy of the advice increases, the price of anarchy improves smoothly from about $0.457$ to $1$.

Cite

Text

Deng et al. "Efficiency of the First-Price Auction in the Autobidding World." Neural Information Processing Systems, 2024. doi:10.52202/079017-4420

Markdown

[Deng et al. "Efficiency of the First-Price Auction in the Autobidding World." Neural Information Processing Systems, 2024.](https://mlanthology.org/neurips/2024/deng2024neurips-efficiency/) doi:10.52202/079017-4420

BibTeX

@inproceedings{deng2024neurips-efficiency,
  title     = {{Efficiency of the First-Price Auction in the Autobidding World}},
  author    = {Deng, Yuan and Mao, Jieming and Mirrokni, Vahab and Zhang, Hanrui and Zuo, Song},
  booktitle = {Neural Information Processing Systems},
  year      = {2024},
  doi       = {10.52202/079017-4420},
  url       = {https://mlanthology.org/neurips/2024/deng2024neurips-efficiency/}
}