Abstract
The celebrated model of auctions with interdependent valuations, introduced by Milgrom and Weber in 1982, has been studied almost exclusively under private signals s_1, ⋯, s_n of the n bidders and public valuation functions v_i(s_1, ⋯, s_n). Recent work in TCS has shown that this setting admits a constant approximation to the optimal social welfare if the valuations satisfy a natural property called submodularity over signals (SOS). More recently, Eden et al. (2022) have extended the analysis of interdependent valuations to include settings with private signals and private valuations, and established O(log 2 n)-approximation for SOS valuations. In this paper we show that this setting admits a constant factor approximation, settling the open question raised by Eden et al. (2022).
Original language | English |
---|---|
Title of host publication | Proceedings - 2023 IEEE 64th Annual Symposium on Foundations of Computer Science, FOCS 2023 |
Publisher | IEEE Computer Society |
Pages | 148-163 |
Number of pages | 16 |
ISBN (Electronic) | 9798350318944 |
DOIs | |
State | Published - 2023 |
Event | 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023 - Santa Cruz, United States Duration: 6 Nov 2023 → 9 Nov 2023 |
Publication series
Name | Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS |
---|---|
ISSN (Print) | 0272-5428 |
Conference
Conference | 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023 |
---|---|
Country/Territory | United States |
City | Santa Cruz |
Period | 6/11/23 → 9/11/23 |
Bibliographical note
Publisher Copyright:© 2023 IEEE.
Keywords
- interdependent
- submodular
- truthful