Information Elicitation Mechanisms for Bayesian Auctions (Abstract Reprint)

Authors

  • Jing Chen Department of Computer Science and Technology, Tsinghua University, Beijing, China
  • Bo Li Department of Computing, The Hong Kong Polytechnic University, Hong Kong, China
  • Yingkai Li Department of Economics, National University of Singapore, Singapore

DOI:

https://doi.org/10.1609/aaai.v40i47.41375

Abstract

In this paper we design information elicitation mechanisms for Bayesian auctions. While in Bayesian mechanism design the distributions of the players’ private types are often assumed to be common knowledge, information elicitation considers the situation where the players know the distributions better than the decision maker. To weaken the information assumption in Bayesian auctions, we consider an information structure where the knowledge about the distributions is arbitrarily scattered among the players. In such an unstructured information setting, we design mechanisms for unit-demand auctions and additive auctions that aggregate the players’ knowledge, generating revenue that are constant approximations to the optimal Bayesian mechanisms with a common prior. Our mechanisms are 2-step dominant-strategy truthful, and the approximation ratios improve gracefully with the amount of knowledge the players collectively have.

Downloads

Published

2026-03-14

How to Cite

Chen, J., Li, B., & Li, Y. (2026). Information Elicitation Mechanisms for Bayesian Auctions (Abstract Reprint). Proceedings of the AAAI Conference on Artificial Intelligence, 40(47), 39860–39860. https://doi.org/10.1609/aaai.v40i47.41375