Bi and Branching Strict Nash Networks in Two-way Flow Models: a Generalized Sufficient Condition

Banchongsan Charoensook

No 273140, ETA: Economic Theory and Applications from Fondazione Eni Enrico Mattei (FEEM)

Abstract: Bi and branching networks are two classes of minimal networks often found in the literatures of two-way flow Strict Nash networks. Why so? In this paper, we answer this question by establishing a generalized condition that holds together many models in the literature, and then show that this condition is sufficient to guarantee their common result: every non-empty component of minimal SNN is either a branching or Bi network. This paper, therefore, contributes to the literature by providing a generalization of several existing works in the literature of two-way flow Strict Nash networks.

Keywords: Research; Methods/Statistical; Methods (search for similar items in EconPapers)
Pages: 23
Date: 2018-05-24
New Economics Papers: this item is included in nep-gth
References: Add references at CitEc
Citations:

Downloads: (external link)
https://ageconsearch.umn.edu/record/273140/files/NDL2018-012.pdf (application/pdf)
https://ageconsearch.umn.edu/record/273140/files/NDL2018-012.pdf?subformat=pdfa (application/pdf)

Related works:
Journal Article: Bi and Branching Strict Nash Networks in Two-way Flow Models: A Generalized Sufficient Condition (2020)
Working Paper: Bi and Branching Strict Nash Networks in Two-way Flow Models: a Generalized Sufficient Condition (2018)
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:ags:feemth:273140

DOI: 10.22004/ag.econ.273140

Access Statistics for this paper

More papers in ETA: Economic Theory and Applications from Fondazione Eni Enrico Mattei (FEEM) Contact information at EDIRC.
Bibliographic data for series maintained by AgEcon Search ().