atlas

Research map / Multi-agent systems and games / Games and equilibria

Approximations for Indivisible Concave Allocations with Applications to Nash Welfare Maximization

AAAI 2023 · Multi-agent systems and games › Games and equilibria · approach: Fair division and coalition formation · 1 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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 local multiplicative curvature to guide item reassignment and stoppingICA · ICA instancesapproximation ratio: (1 + ϵ) maxi µiHelped
Use local additive curvature to guide item reassignment and stoppingICA · ICA instancesadditive approximation: P i αi + ϵHelped
Use uniform agent bids and weighted bang-per-buck item assignmentAsymmetric Nash Welfare with smooth additive valuations · Smooth Asymmetric Nash Welfareapproximation ratio: O(eϵ/(ω ln(1 + 1/ω)))Helped
Apply curvature-based allocation to piecewise-linear valuations when segment lengths cover the maximum item utilityICA · ICA with piecewise-linear valuationsapproximation ratio: (1 + ϵ)4/3Helped

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