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
DownloadTo refer to this page use:
http://arks.princeton.edu/ark:/88435/pr1h264
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Eden, Alon | - |
dc.contributor.author | Feldman, Michal | - |
dc.contributor.author | Friedler, Ophir | - |
dc.contributor.author | Talgam-Cohen, Inbal | - |
dc.contributor.author | Weinberg, S Matthew | - |
dc.date.accessioned | 2021-10-08T19:47:55Z | - |
dc.date.available | 2021-10-08T19:47:55Z | - |
dc.date.issued | 2021 | en_US |
dc.identifier.citation | Eden, 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.2039 | en_US |
dc.identifier.issn | 0030-364X | - |
dc.identifier.uri | https://arxiv.org/pdf/1612.04746v1.pdf | - |
dc.identifier.uri | http://arks.princeton.edu/ark:/88435/pr1h264 | - |
dc.description.abstract | We 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.extent | 188 - 206 | en_US |
dc.language.iso | en_US | en_US |
dc.relation.ispartof | Operations Research | en_US |
dc.rights | Author's manuscript | en_US |
dc.title | A Simple and Approximately Optimal Mechanism for a Buyer with Complements | en_US |
dc.type | Journal Article | en_US |
dc.identifier.doi | 10.1287/opre.2020.2039 | - |
dc.identifier.eissn | 1526-5463 | - |
pu.type.symplectic | http://www.symplectic.co.uk/publications/atom-terms/1.0/journal-article | en_US |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
SimpleApproximateOptimalMechanismBuyerComplements.pdf | 321.52 kB | Adobe PDF | View/Download |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.