6 citations · 11 across the 12 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
math.PR2026
Flexibility allocation in random bipartite matching markets: exact matching rates and dominance regimes
Taha Ameen, Flore Sentenac, Sophie H. Yu
This paper studies how a fixed flexibility budget should be allocated across the two sides of a balanced bipartite matching market. We model compatibilities via a sparse bipartite…
cs.DS2026
On the Average-Case Performance of Greedy for Maximum Coverage
Eric Balkanski, Jason Chatzitheodorou, Flore Sentenac
For the classical maximum coverage problem, the greedy algorithm achieves a worst-case approximation, which is optimal unless . The notion of coverage…
math.PR2026
A uniformity principle for spatial matching
Taha Ameen, Flore Sentenac, Sophie H. Yu
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 no…