Online Matching in Sparse Random Graphs: Non-Asymptotic Performances of Greedy Algorithm
–Neural Information Processing Systems
Motivated by sequential budgeted allocation problems, we investigate online matching problems where connections between vertices are not i.i.d., but they have fixed
Neural Information Processing Systems
Aug-16-2025, 23:21:08 GMT
- Country:
- Europe
- France > Île-de-France
- United Kingdom > England
- Cambridgeshire > Cambridge (0.04)
- North America > United States (0.04)
- Europe
- Genre:
- Research Report (0.46)
- Industry:
- Information Technology > Services (0.67)
- Technology: