2020
DOI: 10.2139/ssrn.3609182
|View full text |Cite
|
Sign up to set email alerts
|

Redistributive Allocation Mechanisms

Abstract: Many scarce public resources are allocated below market-clearing prices (and sometimes for free). Such "non-market" mechanisms necessarily sacrifice some surplus, yet they can potentially improve equity by increasing the rents enjoyed by agents with low willingness to pay. In this paper, we develop a model of mechanism design with redistributive concerns. Agents are characterized by a privately observed willingness to pay for quality, and a publicly observed label. A market designer controls allocation and pri… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
13
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
2

Relationship

2
6

Authors

Journals

citations
Cited by 16 publications
(13 citation statements)
references
References 40 publications
0
13
0
Order By: Relevance
“…This formulation is easily generalized to other multiplicative, super-modular production functions and also (at least for some questions) to non-linear costs.34 This follows from the rearrangement inequality ofHardy, Littlewood, and Polya (1929). Under complete information, the set of feasible allocations is the set of measure-preserving mappings such that each subset of prizes is matched to a subset of agents of equal measure.35 In recent work,Akbarpour, Dworczak, and Kominers (2020) discussed the main role played by the extreme points identified above for problems where a designer maximizes a weighted sum of revenue and social surplus given an arbitrary set of Pareto weights.36 F being convex implies, in particular, that F first-order stochastically dominates the uniform distribution on [0 1]. The present result generalizes the one in HMS, who did not consider intermediate schemes.…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…This formulation is easily generalized to other multiplicative, super-modular production functions and also (at least for some questions) to non-linear costs.34 This follows from the rearrangement inequality ofHardy, Littlewood, and Polya (1929). Under complete information, the set of feasible allocations is the set of measure-preserving mappings such that each subset of prizes is matched to a subset of agents of equal measure.35 In recent work,Akbarpour, Dworczak, and Kominers (2020) discussed the main role played by the extreme points identified above for problems where a designer maximizes a weighted sum of revenue and social surplus given an arbitrary set of Pareto weights.36 F being convex implies, in particular, that F first-order stochastically dominates the uniform distribution on [0 1]. The present result generalizes the one in HMS, who did not consider intermediate schemes.…”
mentioning
confidence: 99%
“… In recent work, Akbarpour, Dworczak, and Kominers (2020) discussed the main role played by the extreme points identified above for problems where a designer maximizes a weighted sum of revenue and social surplus given an arbitrary set of Pareto weights. …”
mentioning
confidence: 99%
“… If lump‐sum transfers are not available, then rationing can sometimes arise as a second‐best way of redistributing across the market. We undertake a more general analysis of the case without lump‐sum transfers in a follow‐up paper (Akbarpour ®Dworczak ®Kominers (2021)), which also allows heterogeneous objects. …”
mentioning
confidence: 99%
“… We discuss redistributive allocation of essential goods in more detail in a follow‐up paper (Akbarpour ®Dworczak ®Kominers (2021)). …”
mentioning
confidence: 99%
“…The way we introduce quality differs fromAkbarpour et al (2020) who look at optimal allocation policies that depend on continuous good quality with transfers.…”
mentioning
confidence: 99%