Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 91 tok/s
Gemini 2.5 Pro 58 tok/s Pro
GPT-5 Medium 29 tok/s
GPT-5 High 29 tok/s Pro
GPT-4o 102 tok/s
GPT OSS 120B 462 tok/s Pro
Kimi K2 181 tok/s Pro
2000 character limit reached

Sorting in Networks: Adversity and Structure (1503.07389v5)

Published 25 Mar 2015 in q-fin.EC and cs.GT

Abstract: People choose friendships with people similar to themselves, i.e. they sort by resemblence. Economic studies have shown when sorting is optimal and constitute an equilibrium, however, this presumes lack of beneficial spillovers. We investigate formation of economic and social networks where agents may form or cut ties. We combine a setup with link formation where agents have types that determine the value of a connection. We provide conditions for sorting in friendships, i.e. that agents tend to partner only with those with those sufficiently similar to themselves. Conditions are provided with and without beneficial spillovers from indirect connections. We show that sorting may be suboptimal, yet a socially stable outcome, despite otherwise obeying the conditions for sorting in Becker (1973). We analyze policy tools to mitigate suboptimal sorting. Another feature is that agents with higher value are more central in networks under certain conditions; a side effect is sorting by degree centrality under certain conditions. Finally we illustrate the limits to patterns of sorting and centrality.

Citations (1)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.