AI Paper Atlas

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

Migration as Submodular Optimization

Paul Gölz, Ariel D. Procaccia

AAAI 2019 · Learning theory and algorithms › Submodular and game algorithms · approach: Streaming submodular algorithms · 23 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
Account for competition effects with a submodular objective instead of assuming additivityGreedy migration matching · Simulations across the retroactive-correction, interview, and coordination modelsemployment: 10% and moreImproved
Account for competition effects with a submodular objective instead of assuming additivityGreedy migration matching · Simulated settings overallemploymentImproved
Use submodular greedy optimization rather than additive optimizationMigration matching in specialized localities · Specialization levels 3 and 4employmentMixed
Use submodular greedy optimization rather than additive optimizationMigration matching with scarce jobs · Job-availability simulationsemploymentImproved

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