Stable matchings and fixed points in trading networks: A note

Hiroyuki Adachi

Economics Letters, 2017, vol. 156, issue C, 65-67

Abstract: Building on the work of Ostrovsky (2008) on supply chain networks, Fleiner et al. (2016) showed that, in possibly cyclic trading networks under fully substitutable preferences, the set of fully trail-stable matchings is nonempty by characterizing it using the set of the fixed points of an increasing function. I characterize the fully trail-stable matchings using a different fixed point (increasing) function, rendering generalized T-algorithm for such environments.

Keywords: The gross substitutes condition; Full substitutability (search for similar items in EconPapers)
JEL-codes: C78 D47 (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165176517301349
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ecolet:v:156:y:2017:i:c:p:65-67

DOI: 10.1016/j.econlet.2017.03.032

Access Statistics for this article

Economics Letters is currently edited by Economics Letters Editorial Office

More articles in Economics Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().