AI Paper Atlas

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

Complexity of Manipulating Sequential Allocation

Haris Aziz, Sylvain Bouveret, Jérôme Lang, Simon Mackenzie

AAAI 2017 · Learning theory and algorithms › Submodular and game algorithms · approach: Fair division of indivisible goods · 19 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
Allow the setting to have a general number of agents rather than restrict it to twoSequential allocation best-response computation · Sequential allocationbest-response complexity: polynomial-time -> NP-completeHurt
Restrict the setting to two agentsSequential allocation best-response computation · Sequential allocation, two agentsbest-response complexity: NP-complete -> polynomial-timeImproved
Allow at least two non-manipulating agentsSequential allocation best responses · Sequential allocation, three or more agentsallocation uniquenessHurt

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