Constant Approximation for Private Interdependent Valuations

Alon Eden, Michal Feldman, Kira Goldner, Simon Mauras, Divyarthi Mohan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 languageEnglish
Title of host publicationProceedings - 2023 IEEE 64th Annual Symposium on Foundations of Computer Science, FOCS 2023
PublisherIEEE Computer Society
Pages148-163
Number of pages16
ISBN (Electronic)9798350318944
DOIs
StatePublished - 2023
Event64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023 - Santa Cruz, United States
Duration: 6 Nov 20239 Nov 2023

Publication series

NameProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
ISSN (Print)0272-5428

Conference

Conference64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023
Country/TerritoryUnited States
CitySanta Cruz
Period6/11/239/11/23

Funding

FundersFunder number
NSF-BSF2020788
National Science FoundationCNS-2228610
Horizon 2020 Framework Programme
European Research Council
Horizon 2020866132

    Keywords

    • interdependent
    • submodular
    • truthful

    Cite this