No article text was recorded for this version.
computational complexity of fair division
Version 1 of 161 papers71 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Obtaining a Proportional Allocation by Deleting Items
- Blog: Minimizing Symmetric Convex Functions over Hybrid of Continuous and Discrete Convex Sets
- Blog: Obtaining a Proportional Allocation by Deleting Items
- Blog: Competitive Equilibrium with Equal Incomes for Allocation of Indivisible Objects
- Blog: Fair division of indivisible goods: Recent progress and open questions
- Blog: Reachability of Fair Allocations via Sequential Exchanges
- Blog: The Complexity of Computing Maximin Share Allocations on Graphs
- Blog: On the Pursuit of EFX for Chores: Non-existence and Approximations
- Blog: The Complexity of Fair Division of Indivisible Items with Externalities
- Blog: The Complexity of Fairness Through Equilibrium
- Blog: Achieving Proportionality up to the Maximin Item with Indivisible Goods
- Blog: Fair Division: Algorithms, Solution Concepts, and Applications (Dagstuhl Seminar 24401)
- Blog: Equitable Allocations of Indivisible Goods
- Blog: Competitive Equilibrium with Chores: Combinatorial Algorithm and Hardness
- Blog: Maximin Share Allocations on Cycles
- Blog: Fairness in multiuser systems with polymatroid capacity region
- Blog: Envy-Free Allocations Respecting Social Networks
- Blog: A Fair Allocation is Approximately Optimal for Indivisible Chores, or Is It?
- Blog: Fair Division: The Computer Scientist's Perspective
- Blog: Preventing Fairness Gerrymandering: Auditing and Learning for Subgroup Fairness
- Blog: On the Complexity of Pareto-Optimal and Envy-Free Lotteries
- Blog: Temporal Fair Division
- Blog: The frontier of intractability for EFX with two agents
- Blog: On Hierarchies of Fairness Notions in Cake Cutting: From Proportionality to Super Envy-Freeness
- Blog: Almost Envy-Freeness for Groups: Improved Bounds via Discrepancy Theory
- Blog: Parameterized Complexity of Incomplete Connected Fair Division
- Blog: Fair Scheduling for Time-dependent Resources
- Blog: Fair and Efficient Completion of Indivisible Goods
- Blog: Computing Fair Utilitarian Allocations of Indivisible Goods
- Blog: Several Stories about High-Multiplicity EFx Allocation (Student Abstract)
- Blog: On the cost of essentially fair clusterings
- Blog: Consensus-Halving: Does It Ever Get Easier?
- Blog: Challenges in Resource and Cost Allocation
- Blog: Envy-Free Allocation of Indivisible Goods via Noisy Queries
- Blog: Fair Division Minimizing Inequality
- Blog: Multivariate Analysis of Scheduling Fair Competitions
- Blog: Unfairly Splitting Separable Necklaces
- Blog: Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels
- Blog: Random Assignment of Indivisible Goods under Constraints
- Blog: Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents
- Blog: Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem
- Blog: Approximability Landscape of Welfare Maximization within Fair Allocations
- Blog: Fair Division of Indivisible Goods: A Survey
- Blog: (Almost Full) EFX for Three (and More) Types of Agents
- Blog: Almost Envy-Freeness with General Valuations
- Blog: Knowledge, Fairness, and Social Constraints
- Blog: Assignments for Congestion-Averse Agents: Seeking Competitive and Envy-Free Solutions
- Blog: Envy-Free House Allocation under Uncertain Preferences
- Blog: Fair Resource Allocation in a Simple Multi-agent Setting: Search Algorithms and Experimental Evaluation
- Blog: Online Min-Max Paging
- Blog: Consensus Halving for Sets of Items
- Blog: Proportionally Fair Makespan Approximation
- Blog: How to Resolve Envy by Adding Goods
- Blog: Pizza Sharing Is PPA-Hard
- Blog: Algorithms for Max-Min Share Fair Allocation of Indivisible Chores
- Blog: The Classes PPA-k: Existence from Arguments Modulo k
- Blog: Computational Complexity of Weighted Threshold Games
- Blog: The Complexity of Extending Fair Allocations of Indivisible Goods
- Blog: Breaking the 3/4 Barrier for Approximate Maximin Share
- Blog: Fair Allocation of Indivisible Chores: Beyond Additive Costs
Showing 60 of 61 papers.
History & citation
Current · Permanent link
- This direction split from The Computational Boundaries of Fair Resource Allocation (95% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_computational_complexity_of_fair_divisio_1292c73e,
title = {computational complexity of fair division},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/computational-complexity-of-fair-division/rdr_1292c73e4ce746d4bf3cb23ad3a81982},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_computational_complexity_of_fair_divisio_1292c73e_v1,
title = {computational complexity of fair division},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/computational-complexity-of-fair-division/rdr_1292c73e4ce746d4bf3cb23ad3a81982/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}