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....

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....

We develop a theory of monotone comparative statics based on weak set order, or in short, weak monotone comparative statics, and identify the enabling conditions in the context of individual choices, Pareto optimal choices for a coalition of agents, and Nash equilibria of games. Compared with...