Topological Conditions for Uniqueness of Equilibrium in Networks
Igal Milchtaich ()
Additional contact information
Igal Milchtaich: Bar-Ilan University
No 2003-01, Working Papers from Bar-Ilan University, Department of Economics
Abstract:
Equilibrium flow in a physical network with a large number of users (e.g., transportation, communication, and computer networks) may not be unique if the costs of the network elements are not the same for all uses. Such differences among users may arise if they are not equally affected by congestion or have different intrinsic preferences. Whether or not, for all assignments of cost functions, each user’s equilibrium cost is the same in all Nash equilibria can be determined from the network topology. Specifically, this paper shows that in a two-terminal network, the equilibrium costs are always unique if and only if the network is one of several simple networks or consists of several such networks connected in series. The complementary class of all two-terminal networks with multiple equilibrium costs for some assignment of (user-specific) cost functions is similarly characterized by an embedded network of a particular simple type.
Keywords: Congestion; externalities; equilibrium flow; network topology; uniqueness of equilibrium. (search for similar items in EconPapers)
JEL-codes: C72 R41 (search for similar items in EconPapers)
Date: 2003-03
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
https://www2.biu.ac.il/soc/ec/wp/1-03/1-03.pdf Working paper (application/pdf)
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:biu:wpaper:2003-01
Access Statistics for this paper
More papers in Working Papers from Bar-Ilan University, Department of Economics Contact information at EDIRC.
Bibliographic data for series maintained by Department of Economics ().