Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
