2010/11/10 by Ankur Mani, Asuman Ozdaglar, Mani, Ankur +3
Decision Sciences · Economics, Econometrics and Finance · #Computer Science and Game Theory (cs.GT) #Economic theories and models #FOS: Computer and information sciences #G.1.6 #G.2.2 #Game Theory and Applications #Game Theory and Voting Systems #J.4 #Social and Information Networks (cs.SI)
paper · pdf · doi:10.48550/arxiv.1011.2515
openalex publication_date 2010/11/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we show that when individuals in a bipartite network exclusively choose partners and exchange valued goods with their partners, then there exists a set of exchanges that are pair-wise stable. Pair-wise stability implies that no individual breaks her partnership and no two neighbors in the network can form a new partnership while breaking other partnerships if any so that at least one of them improves her payoff and the other one does at least as good. We consider a general class of continuous, strictly convex and strongly monotone preferences over bundles of goods for individuals. Thus, this work extends the general equilibrium framework from markets to networks with exclusive exchanges. We present the complete existence proof using the existence of a generalized stable matching in \citeGeneralized-Stable-Matching. The existence proof can be extended to problems in social games as in \citeMatching-Equilibrium and \citeSocial-Games.