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
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Allow the setting to have a general number of agents rather than restrict it to two | Sequential allocation best-response computation · Sequential allocation | best-response complexity: polynomial-time -> NP-complete | Hurt |
| Restrict the setting to two agents | Sequential allocation best-response computation · Sequential allocation, two agents | best-response complexity: NP-complete -> polynomial-time | Improved |
| Allow at least two non-manipulating agents | Sequential allocation best responses · Sequential allocation, three or more agents | allocation uniqueness | Hurt |
Closest papers by meaning
- Strategic Manipulation in Temporal Voting with Undesirable Candidates (Student Abstract) (AAAI 2025 · similarity 0.88)
- The Complexity of Extending Fair Allocations of Indivisible Goods (AAAI 2025 · similarity 0.87)
- Welfare-Optimal Serial Dictatorships Have Polynomial Query Complexity (AAAI 2025 · similarity 0.87)
- Reachability of Fair Allocations via Sequential Exchanges (AAAI 2024 · similarity 0.87)
- Envy-Free House Allocation under Uncertain Preferences (AAAI 2024 · similarity 0.86)
- The Complexity of Fair Division of Indivisible Items with Externalities (AAAI 2024 · similarity 0.86)
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.
