English

Constant Approximation for Private Interdependent Valuations

Computer Science and Game Theory 2023-10-03 v1 Data Structures and Algorithms

Abstract

The celebrated model of auctions with interdependent valuations, introduced by Milgrom and Weber in 1982, has been studied almost exclusively under private signals s1,,sns_1, \ldots, s_n of the nn bidders and public valuation functions vi(s1,,sn)v_i(s_1, \ldots, 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(log2n)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).

Cite

@article{arxiv.2310.00958,
  title  = {Constant Approximation for Private Interdependent Valuations},
  author = {Alon Eden and Michal Feldman and Kira Goldner and Simon Mauras and Divyarthi Mohan},
  journal= {arXiv preprint arXiv:2310.00958},
  year   = {2023}
}

Comments

In 64th IEEE Symposium on Foundations of Computer Science (FOCS 2023)

R2 v1 2026-06-28T12:37:57.161Z