atlas

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

EF2X Exists for Four Agents

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

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proves EF2X allocations always exist for four agents with cancelable (and one monotone) valuations via a pseudo-polynomial constructive algorithm, and gives a polynomial-time algorithm for three agents.

Problem

Existence of EFX allocations of indivisible goods for four agents is open; this work studies the relaxation EF2X (envy vanishes after removing any two goods) for four agents with cancelable valuations.

Approach

Constructive algorithm that transforms partitions through stages (A, B, B1, B2, B2i, B2ii) using a potential function (agent 1's value for the first bundle), swap-optimization between two agents' bundles, and EF2X-best bundles so that the under-demanded bundle gains goods while other agents remain satisfied.

Key results

Surprising findings

Limitations

Experimental setup

Baselines: EFX existence for three agents (additive) EF2X for bounded valuations

Builds on: EFX PR algorithm cancelable valuations MMS-feasible valuations

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