Research map / Learning theory and algorithms / Submodular and game algorithms
Bi-Objective Online Matching and Submodular Allocations
Hossein Esfandiari, Nitish Korula, Vahab Mirrokni
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Randomly routing each item to one of two greedy algorithms (probability p to f, 1-p to g) instead of a single greedy | bi-objective online submodular welfare maximization · theoretical analysis (online SWM) | competitive ratio | Improved |
| Sampling items with probability p before running greedy for single-objective SWM | online SWM · theoretical analysis | competitive ratio: p/(1+p) vs 1/2 for full greedy | No clear effect |
| Using a probabilistic mix of exponential weight algorithms for the two objectives in weighted matching | bi-objective online weighted matching · theoretical analysis | competitive ratio | Improved |
Closest papers by meaning
- Maximizing the Success Probability of Policy Allocations in Online Systems (AAAI 2024 · similarity 0.87)
- Learning-Augmented Online Bipartite Fractional Matching (NeurIPS 2025 · similarity 0.86)
- Online Resource Allocation With General Constraints (NeurIPS 2026 · similarity 0.85)
- Online Budgeted Matching with General Bids (NeurIPS 2024 · similarity 0.85)
- Online and Streaming Algorithms for Constrained k-Submodular Maximization (AAAI 2025 · similarity 0.84)
- Procurement Auctions via Approximately Optimal Submodular Optimization (ICML 2025 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
