AI Paper Atlas

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

Group Fair Matchings Using Convex Cost Functions

Atasi Panda, Harsh Sharma, Anand Louis, Prajakta Nimbhorkar

AAAI 2026 · Learning theory and algorithms › Submodular and game algorithms · approach: Fair division of indivisible goods · 0 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
use Algorithm 1 (flow/LP-based) instead of utility-to-cost greedygroup fair matching with convex costs · MovieLens 100k top-10 moviestotal cost: 1816 -> 1788 (threshold 500, vs LP 1802 for Alg 1)Improved
use Algorithm 1 instead of greedygroup fair matching with convex costs · MovieLens 100k top-20 moviestotal cost: 1076 -> 1088 (threshold 500); 8030 -> 7986 (threshold 1500)Mixed
use Algorithm 1 instead of naive greedygroup fair matching with convex costs · MovieLens 100k top-10 moviestotal cost: 3384 -> 1802 (threshold 500)Improved
use Algorithm 1 instead of greedygroup fair matching with convex costs · MovieLens 100k top-10 moviesrun time (s): 0.757 -> 1.545 (threshold 500)Hurt

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