Simultaneous 2nd price item auctions with no-underbidding.

THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE(2023)

引用 1|浏览64
暂无评分
摘要
The literature on the Price of Anarchy (PoA) of simple auctions employs a no-overbidding assumption but has completely overlooked the no-underbidding phenomenon, which is evident in empirical studies on variants of the second price auction. In this work, we provide a theoretical foundation for the no-underbidding phenomenon. We study the PoA of simultaneous 2nd price auctions (S2PA) under a new natural condition of no underbidding, meaning that agents never bid on items less than their marginal values. We establish improved (mostly tight) bounds on the PoA of S2PA under no-underbidding for different valuation classes, in both full-information and incomplete information settings. Specifically, we show that the PoA is at least 1/2 for general monotone valuations, which extends to Bayesian PoA with arbitrary correlated distributions. We also establish a tight PoA bound of 2/3 for S2PA with XOS valuations, under no-overbidding and nounderbidding, which extends to Bayesian PoA with independent distributions. & COPY; 2023 Elsevier Inc. All rights reserved.
更多
查看译文
关键词
Algorithmic game theory, Simultaneous item bidding auctions, Price of anarchy
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要