On a characterization of stable matchings

By Hiroyuki Adachi. 2000

124 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/cb8a040a1deef63de28d89abe83b08ff0b3f71a1

How researchers see this paper

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

In Economics and Econometrics

Citations in the corpus

Stability in Supply Chain Networks (2005, unknown): “These algorithms are similar to the T -algorithm of Adachi (2000) and Echenique and Oviedo (2004a, 2004b) and the generalized Gale-Shapley algorithm of Hatfield and Milgrom (2005), and all of the above are descendants of the Deferred Acceptance Algorithm (Gale and Shapley, 1962).”
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”
A Supply and Demand Framework for Two-Sided Matching Markets (2016, unknown): “Finally, an influential paper by Adachi (2000) gives a characterization of stable matchings in terms of fixed points of an operator over pre-matchings.”
Algorithmics of Matching Under Preferences (2013, background): “Two additional characterisations of sm based on a fixed-point approach have been formulated by Adachi [31] and Fleiner [208–211].”
The Revealed Preference Theory of Stable and Extremal Stable Matchings (2010, unknown): “Of course, Alkan and Gale do not treat the issue of rationalizing a matching when preferences are unknown. The econometric problem of identifying and estimating preferences in the model with transfers is treated in, among others, Choo and Siow (2006), Dagsvik (2000), Fox (2007), and Galichon and Sal”
Discrete convex analysis: A tool for economics and game theory (2016, methodology): “For stable matchings, use and power of Tarski’s fixed point theorem are demonstrated by Adachi (2000), Fleiner (2003), and Farooq et al. (2012). It may be said, however, that Tarski’s fixed point theorem is rather independent of discrete convex analysis. Yet another type of discrete fixed point theo”
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).”