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.