A uniformity principle for spatial matching
Taha Ameen, Flore Sentenac, Sophie H. Yu

TL;DR
This paper introduces a uniformity principle for spatial matching, showing that more uniform service range allocations in bipartite geometric graphs lead to higher expected demand fulfillment, with implications for platform design.
Contribution
It establishes a novel uniformity principle linking service range distribution to matching success, supported by theoretical analysis and closed-form expressions for specific cases.
Findings
More uniform service ranges increase expected matching size.
Diminishing returns and limited interference explain the uniformity principle.
Guidance for service-range allocation in various platform markets.
Abstract
Platforms matching spatially distributed supply to demand face a fundamental design choice: given a fixed total budget of service range, how should it be allocated across supply nodes ex ante, i.e. before supply and demand locations are realized, to maximize fulfilled demand? We model this problem using bipartite random geometric graphs where supply and demand nodes are uniformly distributed on (), and edges form when demand falls within a supply node's service region, the volume of which is determined by its service range. Since each supply node serves at most one demand, platform performance is determined by the expected size of a maximum matching. We establish a uniformity principle: whenever one service range allocation is more uniform than the other, the more uniform allocation yields a larger expected matching. This principle emerges from diminishing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTransportation and Mobility Innovations · Advanced Queuing Theory Analysis · Age of Information Optimization
