A Fixed-Point Approach to Stable Matchings and Some Applications

By Tamás Fleiner. Mathematics of Operations Research, 2003

299 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A Theory of Stability in Many-to-Many Matching Markets (2004, methodology): “If the documents have been made available under an Open Content Licence (especially Creative Commons Licences), you may exercise further usage rights as specified in the indicated licence. https://creativecommons.org/licenses/by-nc/2.5 www.econstor.eu”
Efficient Matching under Distributional Constraints: Theory and Applications (2015, background): “Motivated by the matching system for higher education in Hungary, Biró, Fleiner, Irving, and Manlove (2010) extend these models to cases in which capacity constraints are imposed on a nested system of sets.”
(Il)legal Assignments in School Choice (2017, methodology): “Our definition of LAD is equivalent to size monotonicity introduced by Alkan and Gale (2003) and Fleiner (2003).”
Matching With (Branch‐of‐Choice) Contracts at the United States Military Academy (2013, background): “Early papers that relate the deferred acceptance algorithm to fixed-point techniques in lattice theory are Adachi (2000), Fleiner (2003), and Echenique and Oviedo (2004).”
Matching with Contracts: Comment (2013, background): “These papers include Alkan (2002), Alkan and Gale (2003), and Fleiner (2003).”
Matching with Contracts (2005, unknown): “Tamás Fleiner.”