Robust Multidimensional Pricing: Separation without Regret

We study a robust monopoly pricing problem with a minimax regret objective, where a seller endeavors to sell multiple goods to a single buyer, only knowing that the buyer's values for the goods range over a rectangular uncertainty set. We interpret this pricing problem as a zero-sum game between the seller, who chooses a selling mechanism, and a fictitious adversary or `nature', who chooses the buyer's values from within the uncertainty set. Using duality techniques rooted in robust optimization, we prove that this game admits a Nash equilibrium in mixed strategies that can be computed in closed form. The Nash strategy of the seller is a randomized posted price mechanism under which the goods are sold separately, while the Nash strategy of nature is a distribution on the uncertainty set under which the buyer's values are comonotonic. We further show that the restriction of the pricing problem to deterministic mechanisms is solved by a deteministic posted price mechanism under which the goods are sold separately.


Published in:
-
Year:
2018
Keywords:
Note:
Available from Optimization Online
Additional link:
Laboratories:




 Record created 2018-07-26, last modified 2019-06-19


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)