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

Generalized Reduced-Form Auctions: A Network-Flow Approach

Abstract: Abstract. We develop a network-flow approach for characterizing interim-allocation rules that can be implemented by ex post allocations. Our method can be used to characterize feasible interim allocations in general multi-unit auctions where agents face capacity constraints, both ceilings and floors. Applications include a variety of settings of practical interest, ranging from individual and group-specific capacity constraints, set-aside sale, partnership dissolution, and government license reallocation.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
60
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 22 publications
(60 citation statements)
references
References 29 publications
0
60
0
Order By: Relevance
“…Border (1991) characterizes which interim allocation probabilities are implementable by some ex post allocation rule in the case of single-unit auctions. Che, Kim, and Mierendorff (2013) provide a substantial generalization of this result to multi-unit auctions, and also extend the reduced-form approach from auctions to the bilateral trade setting. Thus, instead of maximizing over the ex post trade rule, we maximize directly over the interim trade probabilities and can explicitly derive the optimal trade rule.…”
mentioning
confidence: 82%
See 4 more Smart Citations
“…Border (1991) characterizes which interim allocation probabilities are implementable by some ex post allocation rule in the case of single-unit auctions. Che, Kim, and Mierendorff (2013) provide a substantial generalization of this result to multi-unit auctions, and also extend the reduced-form approach from auctions to the bilateral trade setting. Thus, instead of maximizing over the ex post trade rule, we maximize directly over the interim trade probabilities and can explicitly derive the optimal trade rule.…”
mentioning
confidence: 82%
“…In the case of single-unit auctions, Border (1991) characterized which interim allocation probabilities are implementable by some ex post allocation rule. Che et al (2013) generalize this to the case of multi-unit auctions when agents may face capacity constraints. In particular, the results in Che et al (2013) extend to the bilateral trade setting, allowing us to revert to this reduced-form approach.…”
Section: The Revenue Maximization Problemmentioning
confidence: 95%
See 3 more Smart Citations