2000 character limit reached
The lattice of worker-quasi-stable matchings
Published 30 Mar 2021 in econ.TH | (2103.16330v4)
Abstract: In a many-to-one matching model in which firms' preferences satisfy substitutability, we study the set of worker-quasi-stable matchings. Worker-quasi-stability is a relaxation of stability that allows blocking pairs involving a firm and an unemployed worker. We show that this set has a lattice structure and define a Tarski operator on this lattice that models a re-equilibration process and has the set of stable matchings as its fixed points.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.