AI Paper Atlas

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

Proportional Allocation: Simple, Distributed, and Diverse Matching with High Entropy

Shipra Agrawal, Morteza Zadimoghaddam, Vahab Mirrokni

ICML 2018 · Learning theory and algorithms › Submodular and game algorithms · approach: Matching markets and welfare · 17 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
Iterative proportional allocation with multiplicative priority updates (PropAlloc) run for O(log n / ε²) roundsbipartite b-matching (maximum cardinality fractional matching) · theoretical analysisapproximation factor of fractional matchingImproved
Set priority-score step to (1+ε) multiplicative increase/decrease, with ε = δ/5 and R = log(n/ϵ)/ϵ² roundsPropAlloc · theoretical analysisapproximation guarantee (1−δ) of fractional matchingNo clear effect
Add entropy regularization (PropAlloc+ with parameter λ) to weighted matching so the solution has high entropy while achieving (1−δ) of weight-entropy objectivemaximum weighted matching · theoretical analysisweight-entropy objective approximationImproved
Softmax-style proportional allocation rule versus greedy top-capacity selection in MWU-type methodsonline/distributed matching allocation · qualitative argumententropy of allocationImproved

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