Robust Price Discrimination

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Arieli, Itai, Babichenko, Yakov, Madmon, Omer, Tennenholtz, Moshe
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912638743609344
author Arieli, Itai
Babichenko, Yakov
Madmon, Omer
Tennenholtz, Moshe
author_facet Arieli, Itai
Babichenko, Yakov
Madmon, Omer
Tennenholtz, Moshe
contents We consider a model of third-degree price discrimination where the seller's product valuation is unknown to the market designer, who aims to maximize buyer surplus by revealing buyer valuation information. Our main result shows that the regret is bounded by a $\frac{1}{e}$-fraction of the optimal buyer surplus when the seller has zero valuation for the product. This bound is attained by randomly drawing a seller valuation and applying the segmentation of Bergemann et al. (2015) with respect to the drawn valuation. We show that this bound is tight in the case of binary buyer valuation.
format Preprint
id arxiv_https___arxiv_org_abs_2401_16942
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Robust Price Discrimination
Arieli, Itai
Babichenko, Yakov
Madmon, Omer
Tennenholtz, Moshe
Theoretical Economics
Computer Science and Game Theory
We consider a model of third-degree price discrimination where the seller's product valuation is unknown to the market designer, who aims to maximize buyer surplus by revealing buyer valuation information. Our main result shows that the regret is bounded by a $\frac{1}{e}$-fraction of the optimal buyer surplus when the seller has zero valuation for the product. This bound is attained by randomly drawing a seller valuation and applying the segmentation of Bergemann et al. (2015) with respect to the drawn valuation. We show that this bound is tight in the case of binary buyer valuation.
title Robust Price Discrimination
topic Theoretical Economics
Computer Science and Game Theory
url https://arxiv.org/abs/2401.16942