Skip to main content

A Simple and Approximately Optimal Mechanism for a Buyer with Complements

Author(s): Eden, Alon; Feldman, Michal; Friedler, Ophir; Talgam-Cohen, Inbal; Weinberg, S Matthew

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1h264
Full metadata record
DC FieldValueLanguage
dc.contributor.authorEden, Alon-
dc.contributor.authorFeldman, Michal-
dc.contributor.authorFriedler, Ophir-
dc.contributor.authorTalgam-Cohen, Inbal-
dc.contributor.authorWeinberg, S Matthew-
dc.date.accessioned2021-10-08T19:47:55Z-
dc.date.available2021-10-08T19:47:55Z-
dc.date.issued2021en_US
dc.identifier.citationEden, Alon, Michal Feldman, Ophir Friedler, Inbal Talgam-Cohen, and S. Matthew Weinberg. "A Simple and Approximately Optimal Mechanism for a Buyer with Complements." Operations Research 69, no. 1 (2021): 188-206. doi:10.1287/opre.2020.2039en_US
dc.identifier.issn0030-364X-
dc.identifier.urihttps://arxiv.org/pdf/1612.04746v1.pdf-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/pr1h264-
dc.description.abstractWe consider a revenue-maximizing seller with m heterogeneous items and a single buyer whose valuation for the items may exhibit both substitutes and complements. We show that the better of selling the items separately and bundling them together— guarantees a 𝛩(𝑑)-fraction of the optimal revenue, where d is a measure of the degree of complementarity; it extends prior work showing that the same simple mechanism achieves a constant-factor approximation when buyer valuations are subadditive (the most general class of complement-free valuations). Our proof is enabled by a recent duality framework, which we use to obtain a bound on the optimal revenue in the generalized setting. Our technical contributions are domain specific to handle the intricacies of settings with complements. One key modeling contribution is a tractable notion of “degree of complementarity” that admits meaningful results and insights—we demonstrate that previous definitions fall short in this regard.en_US
dc.format.extent188 - 206en_US
dc.language.isoen_USen_US
dc.relation.ispartofOperations Researchen_US
dc.rightsAuthor's manuscripten_US
dc.titleA Simple and Approximately Optimal Mechanism for a Buyer with Complementsen_US
dc.typeJournal Articleen_US
dc.identifier.doi10.1287/opre.2020.2039-
dc.identifier.eissn1526-5463-
pu.type.symplectichttp://www.symplectic.co.uk/publications/atom-terms/1.0/journal-articleen_US

Files in This Item:
File Description SizeFormat 
SimpleApproximateOptimalMechanismBuyerComplements.pdf321.52 kBAdobe PDFView/Download


Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.