Abstract: We provide the first analysis of altruism in networks. Agents are connected through a fixed, weighted network and care about the well-being of their network neigh-bors. Given some initial distribution of incomes, agents may provide financial support to their poorer friends. We characterize the Nash equilibria of this transfer game for general networks and utility functions. We show that equilibria solve a well-behaved maximization program, related to classical problems of optimal transportation on networks. We build on this reformulation and establish existence, uniqueness in consumptions and generic uniqueness in transfers. We show that transfers are affected by the geometry of the altru-istic network. They flow through shortest ...