A Theory of Stable Market Segmentations
We consider a monopolistic seller in a market that may be segmented. The surplus of each consumer in a segment depends on the price that the seller optimally charges, which depends on the set of consumers in the segment. We study which segmentations may result from the interaction among consumers and the seller. Instead of studying the interaction as a non-cooperative game, we take a reduced-form approach and introduce a notion of stability that any resulting segmentation must satisfy. A stable segmentation is one that, for any alternative segmentation, contains a segment of consumers that prefers the original segmentation to the alternative one. Our main result characterizes stable segmentations as efficient and saturated. A segmentation is saturated if no consumers can be shifted from a segment with a high price to a segment with a low price without the seller optimally increasing the low price. We use this characterization to constructively show that stable segmentations always exist. Even though stable segmentations are efficient, they need not maximize average consumer surplus, and segmentations that maximize average consumer surplus need not be stable. Finally, we relate our notion of stability to solution concepts from cooperative game theory and show that stable segmentations satisfy many of them.
Code (0)
등록된 구현이 없습니다.
Tasks
SegmentationSimilar Papers 제목 키워드 기반
Metastable Financial Markets
Metastability is a phenomenon observed in stochastic systems which stay in a false-equilibrium within a region of its state space until the occurrence of a sequence of rare events that leads to an abrupt transition to a …
Causal InferenceTime SeriesRedistribution Through Market Segmentation
We study how to optimally segment monopolistic markets with a redistributive objective. We characterize optimal redistributive segmentations and show that they (i) induce the seller to price progressively, i.e., richer c…
SegmentationThe Large Core of College Admission Markets: Theory and Evidence
We study stable allocations in college admissions markets where students can attend the same college under different financial terms. The deferred acceptance algorithm identifies a stable allocation where funding is allo…
The outcome of the restabilization process in matching markets
For a many-to-one matching model, we study the matchings obtained through the restabilization of stable matchings that had been disrupted by a change in the population. We include a simple representation of the stable ma…
Parallel and Mini-Batch Stable Matching for Large-Scale Reciprocal Recommender Systems
Reciprocal recommender systems (RRSs) are crucial in online two-sided matching platforms, such as online job or dating markets, as they need to consider the preferences of both sides of the match. The concentration of re…
Recommendation Systems