Online Matching in Sparse Random Graphs: Non-Asymptotic Performances of Greedy Algorithm

Nov-15-2025, 11:37:52 GMT–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

artificial intelligence, graph, vertex, (16 more...)

Neural Information Processing Systems

Nov-15-2025, 11:37:52 GMT

Conferences PDF

Add feedback

Country:
- Europe
  - France > Île-de-France
    - Paris > Paris (0.04)
  - United Kingdom > England
    - Cambridgeshire > Cambridge (0.04)
- North America > United States (0.04)

Genre:
- Research Report (0.46)

Industry:
- Information Technology > Services (0.67)

Technology:
- Information Technology > Artificial Intelligence > Representation & Reasoning
  - Mathematical & Statistical Methods (0.51)
  - Search (0.41)