Approximation Schemes for a Unit-Demand Buyer with Independent Items via Symmetries
2019 IEEE 60TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2019), pp. 220.0-232, 2019.
We consider a revenue-maximizing seller with n items facing a single buyer. We introduce the notion of symmetric menu complexity of a mechanism, which counts the number of distinct options the buyer may purchase, up to permutations of the items. Our main result is that a mechanism of quasi-polynomial symmetric menu complexity suffices to ...More
Full Text (Upload PDF)
PPT (Upload PPT)