Approximation Schemes for a Buyer with Independent Items via Symmetries

Divyarthi Mohan
Divyarthi Mohan
Ariel Schvartzman
Ariel Schvartzman

Foundations of Computer Science, 2019.

Cited by: 0|Bibtex|Views48|Links
EI

Abstract:

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 suffic...More

Code:

Data:

Your rating :
0

 

Tags
Comments