AI Paper Atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Bi-Objective Online Matching and Submodular Allocations

Hossein Esfandiari, Nitish Korula, Vahab Mirrokni

NeurIPS 2016 · Learning theory and algorithms › Submodular and game algorithms · approach: Matching markets and welfare · 8 citations (OpenAlex)

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 changedWhereMeasuredEffect
Randomly routing each item to one of two greedy algorithms (probability p to f, 1-p to g) instead of a single greedybi-objective online submodular welfare maximization · theoretical analysis (online SWM)competitive ratioImproved
Sampling items with probability p before running greedy for single-objective SWMonline SWM · theoretical analysiscompetitive ratio: p/(1+p) vs 1/2 for full greedyNo clear effect
Using a probabilistic mix of exponential weight algorithms for the two objectives in weighted matchingbi-objective online weighted matching · theoretical analysiscompetitive ratioImproved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy