Abstract
We give a constructive proof of existence of equilibrium in two-sided matching markets and also show the set of equilibrium prices is pathwise connected. For piecewise linear preferences, an (optimal assignment type) algorithm based on these results can compute an equilibrium in a finite number of steps and likewise reach the buyer-optimal minimum equilibrium prices.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have