Deliberately restricting the number of connections in a network actually increases the number of successful matches.
April 15, 2026
Original Paper
Bipartite matching under communication constraints
arXiv · 2604.10744
The Takeaway
In dense networks, 'random thinning' (deliberately removing options) counterintuitively leads to better overall outcomes for resource allocation. This breaks the 'more-is-better' assumption of network design. By limiting choices, you reduce 'congestion' and communication bottlenecks that usually prevent successful matching in complex systems. For engineers building distributed systems or marketplaces, this suggests that 'less is more.' Restricting the 'search space' for agents can actually lead to a more efficient global state. It's a fundamental lesson in the benefits of strategic constraints.
From the abstract
In modern data center networks, thousands of hosts contend for shared link capacity; the scale of these systems makes centralized scheduling impractical. This article models such scheduling as a bipartite matching problem under communication constraints: senders express interest in forming connections, and receivers respond using only locally available information. A class of single-round probabilistic matching algorithms is proposed, built on two key ideas: degree-biased sampling, in which send