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.
MLA
Che, Yeon‐Koo, et al. “Generalized Reduced‐Form Auctions: A Network‐Flow Approach.” Econometrica, vol. 81, .no 6, Econometric Society, 2013, pp. 2487-2520, https://doi.org/10.3982/ECTA11405
Chicago
Che, Yeon‐Koo, Jinwoo Kim, and Konrad Mierendorff. “Generalized Reduced‐Form Auctions: A Network‐Flow Approach.” Econometrica, 81, .no 6, (Econometric Society: 2013), 2487-2520. https://doi.org/10.3982/ECTA11405
APA
Che, Y., Kim, J., & Mierendorff, K. (2013). Generalized Reduced‐Form Auctions: A Network‐Flow Approach. Econometrica, 81(6), 2487-2520. https://doi.org/10.3982/ECTA11405
Supplement to "Generalized Reduced-Form Auctions: A Network-Flow Approach"
The supplementary material contains (A) omitted proofs, (B) two Lemmas that clarify the compliance property, (C) a discussion of the relationship with the constrained assignment model of Budish et al. (2013), and (D) explains the connection with Edmonds' polymatroid intersection theorem.
By clicking the "Accept" button or continuing to browse our site, you agree to first-party and session-only cookies being stored on your device. Cookies are used to optimize your experience and anonymously analyze website performance and traffic.