@inproceedings{813e71ab9c2c452d8657f428c732e4fb,
title = "Constant Approximation for Private Interdependent Valuations",
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).",
keywords = "interdependent, submodular, truthful",
author = "Alon Eden and Michal Feldman and Kira Goldner and Simon Mauras and Divyarthi Mohan",
note = "Publisher Copyright: {\textcopyright} 2023 IEEE.; 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023 ; Conference date: 06-11-2023 Through 09-11-2023",
year = "2023",
doi = "https://doi.org/10.1109/FOCS57990.2023.00018",
language = "الإنجليزيّة",
series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",
publisher = "IEEE Computer Society",
pages = "148--163",
booktitle = "Proceedings - 2023 IEEE 64th Annual Symposium on Foundations of Computer Science, FOCS 2023",
address = "الولايات المتّحدة",
}