Robustly-optimal mechanism for selling multiple goods
We study robustly-optimal mechanisms for selling multiple items. The seller maximizes
revenue against a worst-case distribution of a buyer's valuations within a set of distributions …
revenue against a worst-case distribution of a buyer's valuations within a set of distributions …
Separation in distributionally robust monopolist problem
We consider a monopoly pricing problem, where a seller has multiple items to sell to a
single buyer, only knowing the distribution of the buyer's value profile. The seller's goal is to …
single buyer, only knowing the distribution of the buyer's value profile. The seller's goal is to …
[PDF][PDF] Rank-Guaranteed Auctions
We design a multi-item ascending auction that is “approximately” optimal, strategically
simple, and robust to strategic and distributional uncertainties. Specifically, the auction is …
simple, and robust to strategic and distributional uncertainties. Specifically, the auction is …