Monotonic Mechanisms for Selling Multiple Goods
Ran Ben-Moshe, Sergiu Hart, Noam Nisan

TL;DR
This paper demonstrates that restricting to monotonic selling mechanisms can significantly reduce revenue compared to nonmonotonic mechanisms, with monotonic mechanisms achieving at most a factor of k of the optimal revenue.
Contribution
It shows that monotonic mechanisms can yield negligible revenue compared to the maximum, and provides characterizations and bounds for monotonic and allocation-monotonic mechanisms.
Findings
Monotonic mechanisms can be at most k times the revenue of simple selling methods.
Maximal revenue can be arbitrarily larger than what monotonic mechanisms achieve.
Characterizations of monotonic and allocation-monotonic mechanisms are provided.
Abstract
Maximizing the revenue from selling two or more goods has been shown to require the use of mechanisms, where a higher-valuation buyer may pay less than a lower-valuation one. Here we show that the restriction to mechanisms may not just lower the revenue, but may in fact yield only a of the maximal revenue; more precisely, the revenue from monotonic mechanisms is no more than k times the simple revenue obtainable by selling the goods separately, or bundled (where k is the number of goods), whereas the maximal revenue may be arbitrarily larger. We then study the class of monotonic mechanisms and its subclass of allocation-monotonic mechanisms, and obtain useful characterizations and revenue bounds.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAuction Theory and Applications · Economic theories and models · Game Theory and Voting Systems
