Papers

Peer-reviewed
Jul, 2017

Stable matchings and fixed points in trading networks: A note

ECONOMICS LETTERS
  • Hiroyuki Adachi

Volume
156
Number
First page
65
Last page
67
Language
English
Publishing type
Research paper (scientific journal)
DOI
10.1016/j.econlet.2017.03.032
Publisher
ELSEVIER SCIENCE SA

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. (C) 2017 Elsevier B.V. All rights reserved.

Link information
DOI
https://doi.org/10.1016/j.econlet.2017.03.032
Web of Science
https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=JSTA_CEL&SrcApp=J_Gate_JST&DestLinkType=FullRecord&KeyUT=WOS:000404312600015&DestApp=WOS_CPL
ID information
  • DOI : 10.1016/j.econlet.2017.03.032
  • ISSN : 0165-1765
  • eISSN : 1873-7374
  • Web of Science ID : WOS:000404312600015

Export
BibTeX RIS