Bi and Branching Strict Nash Networks in Two-way Flow Models: A Generalized Sufficient Condition
Banchongsan Charoensook
The B.E. Journal of Theoretical Economics, 2020, vol. 20, issue 1, 14
Abstract:
Bi and branching networks are two classes of minimal networks often found in the literature of two-way flow Strict Nash networks. Why so? In this paper, we answer this question by establishing a generalized condition that holds together several models in the literature, and then show that this condition is sufficient to guarantee their common result: every non-empty component of minimal Strict Nash network is either a branching or Bi network. This paper, therefore, contributes to the literature of two-way flow Strict Nash networks by merging together several existing works.
Keywords: network formation; strict nash network; two-way flow network; branching network; Bi network (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations:
Downloads: (external link)
https://doi.org/10.1515/bejte-2018-0117 (text/html)
For access to full text, subscription to the journal or payment for the individual article is required.
Related works:
Working Paper: Bi and Branching Strict Nash Networks in Two-way Flow Models: a Generalized Sufficient Condition (2018) 
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:bpj:bejtec:v:20:y:2020:i:1:p:14:n:15
Ordering information: This journal article can be ordered from
https://www.degruyter.com/journal/key/bejte/html
DOI: 10.1515/bejte-2018-0117
Access Statistics for this article
The B.E. Journal of Theoretical Economics is currently edited by Burkhard C. Schipper
More articles in The B.E. Journal of Theoretical Economics from De Gruyter
Bibliographic data for series maintained by Peter Golla ().