List of unsolved problems in fair division

This is a dynamic list and may never be able to satisfy particular standards for completeness. You can help by adding missing items with reliable sources.

This page lists notable open problems related to fair division - a field in the intersection of mathematics, computer science, political science and economics.

Open problems in fair cake-cutting

Query complexity of envy-free cake-cutting

In the problem of envy-free cake-cutting, there is a cake modeled as an interval, and $n$ agents with different value measures over the cake. The value measures are accessible only via queries of the form "evaluate a given piece of cake" or "mark a piece of cake with a given value". With $n=2$ agents, an envy-free division can be found using two queries, via divide and choose. With $n>2$ agents, there are several open problems regarding the number of required queries.

1. First, assume that the entire cake must be allocated (i.e., there is no disposal), and pieces may be disconnected. How many queries are required?

• Lower bound: $\Omega (n^{2})$;
• Upper bound: $O\left(n^{n^{n^{n^{n^{n}}}}}\right)$.

2. Next, assume that some cake may be left unallocated (i.e., there is free disposal), but the allocation must be proportional (in addition to envy-free): each agent must get at least $1/n$ of the total cake value. Pieces may still be disconnected. How many queries are required?

• Lower bound: not known (theoretically it may be polynomially solvable).
• Upper bound: $(n!)^{2}n^{2}$.

3. Next, assume there is free disposal, the allocation must still be proportional, but the pieces must be connected. How many queries are required?

• For $n=3$, there is an algorithm with 54 queries.
• For $n\geq 4$, no finite algorithm is currently known.

4. Next, assume there is free disposal, the pieces must be connected, but the allocation may be only approximately proportional (i.e., some agents may get less than $1/n$ of the total cake value). What value can be guaranteed to each agent using a finite envy-free protocol?

• For $n=3$, there is an algorithm that attains 1/3, which is optimal.
• For $n=4$ (the smallest open case), there is an algorithm that attains 1/7.
• For any $n$, there is an algorithm that attains $1/(3n)$.

5. Finally, assume the entire cake must be allocated, and pieces may be disconnected, but the number of cuts (or number of pieces per agent) should be as small as possible. How many cuts do we need in order to find an envy-free allocation in a finite number of queries?

• For $n\geq 3$, a finite algorithm does not exist for $n-1$ cuts (1 piece per agent).
• For $n=3$, Selfridge–Conway procedure solves the problem in finite time with 5 cuts (and at most 2 pieces per agent).
• For $n\geq 4$, the Aziz-Mackenzie procedure solves the problem in finite time, but with many cuts (and many pieces per agent).
• Smallest open case: three agents and 3 or 4 cuts; four agents and 2 pieces per agent.

Number of cuts for cake-cutting with different entitlements

When all agents have equal entitlements, a proportional cake-cutting can be implemented using $n-1$ cuts, which is optimal.

How many cuts are required for implementing a proportional cake-cutting among $n$ agents with different entitlements?

• Lower bound: $2n-2$;
• Upper bound: $3n-4$.
• Smallest open case: $n=3$ agents with all different entitlements: $1/7$, $2/7$ and $4/7$.

How many cuts are required for implementing an envy-free cake-cutting among $n$ agents with different entitlements?

• Lower bound: $2n-2$, since envy-free implies proportional.
• Upper bound: not known.

Fair division of a partly burnt cake

A partly burnt cake is a metaphor to a cake in which agents may have both positive and negative valuations.

A proportional division of such a cake always exists.

What is the runtime complexity of calculating a connected-proportional allocation of partly burnt cake?

Known cases:

• When all valuations are positive, or all valuations are negative, the Even-Paz protocol finds a connected proportional division using $O(n\log n)$ queries, and this is optimal.
• When valuations may be mixed, a moving-knife protocol can be used to find a connected proportional division using $O(n^{2})$ queries. Can this be improved to $O(n\log n)$ ?

An envy-free division of a partly burnt cake is guaranteed to exist if-and-only-if the number of agents is the power of a prime integer. However, it cannot be found by a finite protocol - it can only be approximated. Given a small positive number D, an allocation is called D-envy-free if, for each agent, the allocation will become envy-free if we move the cuts by at most D (length units).

What is the runtime complexity (as a function of D) of calculating a connected D-envy-free allocation of a partly burnt cake?

Truthful cake-cutting

Truthful cake-cutting is the design of truthful mechanisms for fair cake-cutting. The currently known algorithms and impossibility results are shown here. The main cases in which it is unknown whether a deterministic truthful fair mechanism exists are:

• There are 3 or more agents with piecewise-uniform valuations, without free disposal.
• There are 2 or more agents with piecewise-constant valuations, with or without free disposal (and without additional requirements such as connectivity or non-wastefulness).

Open problems in fair allocation of indivisible items

Approximate maximin-share fairness

The 1-of-$n$ maximin share (MMS) of an agent is the largest utility the agent can secure by partitioning the items into $n$ bundles and receiving the worst bundle. For two agents, divide and choose gives each agent at least his/her 1-of-2 MMS. For $n>2$ agents, it is almost always, but not always, possible to give each agent his/her 1-of-$n$ MMS. This raises several kinds of questions.

1. Computational complexity

What is the runtime complexity of deciding whether a given instance admits a 1-of-$n$ MMS allocation?

• Upper bound: ${NP}^{NP}$ (which is $\Sigma _{2}^{P}$ - level 2 in the polynomial hierarchy)
• Lower bound: none (so it may be level 2 or 1 or even 0 of the hierarchy).

NOTE: the following related problems are known to be computationally hard:

• Calculating the 1-of-$n$ MMS of a given agent is NP-hard even if all agents have additive preferences (reduction from partition problem).
• Deciding whether a given allocation is 1-of-$n$ MMS is co-NP complete for agents with additive preferences.

2. Cardinal approximation

What is the largest fraction r such that there always exists an allocation giving each agent a utility of at least r times his 1-of-$n$ maximin share?

Known cases:

• For two agents: $r=1$ by divide-and-choose.
• For three agents, even with additive valuations: $r<1$. By a carefully crafted example.
• For any number of agents with additive valuations: $r\geq 3/4$.
• For any number of agents with additive negative valuations (i.e., for chores): $r\geq 9/11$.

3. Ordinal approximation

What is the smallest integer $N$ (as a function of $n$) such that there always exists an allocation among $n$ agents giving each agent at least his 1-of-$N$ MMS?

Known cases:

• For two agents: $N=2$. By divide-and-choose.
• For any number of agents with binary valuations: $N=n$. By round-robin. It gives EF1, which implies 1-of-$n$-MMS.
• For $n>2$ agents: $N>n$. By a carefully crafted example.
• For any number of agents with additive valuations: $N\leq 2n-1$, by round-robin. It gives EF1, which implies 1-of-$(2n-1)$-MMS.
• For any number of agents with additive valuations: $N\leq 2n-2$, using envy-free matching.

So the answer can be anything between $n+1$ and $2n-2$, inclusive. Smallest open case:

For $n=4$ agents with additive valuations, does there always exist a 1-of-5 maximin-share allocation?

Note: there always exists an Approximate Competitive Equilibrium from Equal Incomes that guarantees the 1-of-($n+1$) maximin-share. However, this allocation may have excess supply, and - more importantly - excess demand: the sum of the bundles allocated to all agents might be slightly larger than the set of all items. Such an error is reasonable when allocating course seats among students, since a small excess supply can be corrected by adding a small number of seats. But the classic fair division problem assumes that items may not be added.

Envy-free up to one item

An allocation is called EF1 (envy-free up to one item) if, for any two agents $i$ and $j$, and for any subset of size at most one contained in the bundle of $j$, if we remove that subset from $j$'s bundle then $i$ does not envy. An EF1 allocation always exists and can be found by the envy cycles algorithm. Combining it with other properties raises some open questions.

Pareto-optimal EF1 allocation (goods and bads)

When all items are good and all valuations are additive, a PO+EF1 always exists: the allocation maximizing the product of utilities is PO+EF1. Finding this maximizing allocation is NP-hard, but in theory, it may be possible to find other PO+EF1 allocations (not maximizing the product).

What is the run-time complexity of finding a PO+EF1 allocation of goods?

A PO+EF1 allocation of bads (chores) is not known to exist, even when all valuations are additive.

Does a PO+EF1 allocation of bads always exist?

What is the run-time complexity of finding such allocation, if it exists?

Contiguous EF1 allocation

Often the goods are ordered on a line, for example, houses in a street. Each agent wants to get a contiguous block.

For three or more agents with additive valuations, does an EF1 allocation always exist?

Known cases:

• For two agents with additive valuations, the answer is yes: we can round a connected envy-free cake-cutting (e.g., found by divide and choose).
• For $n$ agents with additive valuations, we can find an "EF minus 2" allocation by rounding a connected envy-free cake-cutting, and there also exists an EF2 allocation (proof using a variant of Sperner's lemma).
• For $n$ agents with additive binary valuations (every item value is either 0 or 1), an "EF minus 2" allocation is also EF1, so the answer is yes.

Even when a contiguous EF1 allocation exists, the runtime complexity of finding it is unclear:

For three or more agents with binary additive valuations, what is the complexity of finding a contiguous EF1 allocation?

• A connected envy-free cake-cutting might take infinitely many queries to find. An EF1 allocation can always be found in finite time by checking all possible allocations, but this algorithm requires exponential run-time.

Price of fairness

The price of fairness is the ratio between the maximum social welfare (sum of utilities) in any allocation, and the maximum social welfare in a fair allocation. What is the price of EF1 fairness?

• The upper bound is $O(n)$ - by either Round-robin or maximum Nash welfare.
• The lower bound is $O({\sqrt {n}})$.

Existence of EFx allocation

An allocation is called EFx ("envy-free up to any good") if, for any two agents $i$ and $j$, and for any good in the bundle of $j$, if we remove that good from $j$'s bundle then $i$ does not envy.

For three agents with additive valuations, does there always exist an EFx allocation?

For $n$ agents with general monotone valuations, can we prove that there does not exist an EFx allocation?

Known cases:

• If at least $n-1$ valuations are identical: yes.
• Hence, for two agents: yes. This is true even for general monotone valuations.
• For three agents: yes, by a recent working paper.

See also: envy-free item allocation

Existence of Pareto-efficient PROPx allocation of bads

An allocation of bads is called PROPx (aka FSx) if, for any agent $i$, and for any bad owned by $i$, if we remove that bad from $i$'s bundle, then $i$'s disutility is less than $1/n$ the total disutility.

Does there always exist an allocation of bads that is both PROPx and Pareto-efficient?

Related known cases:

• A PROPx allocation of goods (even without Pareto-efficiency) may not exist.
• A PROPx allocation of bads (without Pareto-efficiency) always exists.
• A PROP1 and Pareto-efficient allocation of either goods or bads always exists.

Competitive equilibrium for almost all incomes

Competitive equilibrium (CE) is a very strong fairness notion - it implies Pareto-optimality and envy-freeness. When the incomes are equal, CE might not exist even when there are two agents and one good. But, in all other income-space, CE exists when there are two agents and one good. In other words, there is a competitive equilibrium for almost all income-vectors.

For two agents with additive valuations over any number of goods, does there exist a competitive equilibrium for almost incomes?

Known cases:

• With three or fewer goods: always yes.
• With four goods: yes for 2 agents with general valuations, no for 3 agents with general valuations, no for 4 agents, even with additive valuations.
• With five or more goods: no for two agents with general valuations.

Open conjectures:

• When there are two agents with additive valuations, CE for almost all incomes exists for any number of goods.
• When there are three agents, even with additive valuations, CE for almost all incomes might not exist.

Fair division of partly divisible items

Runtime complexity of fair allocation with bounded sharing

Given $n\geq 2$ agents, $m$ items and an integer $k$, suppose at most $k$ items can be shared among two or more agents. What is the runtime complexity of deciding whether a proportional / envy-free allocation exists?

Known cases:

• With $k=0$ and identical valuations, for any $n\geq 2$, the problem is equivalent to the partition problem, and therefore it is NP-complete.
• With $k\geq n-1$, the answer is always "yes", and an allocation can be found in polynomial time.
• With $n=3$ and $k=1$ and identical valuations, an allocation can be found in polynomial time if it exists.

Smallest open cases:

• $n=3$ and $k=1$ and different valuations.
• $n=4$ and $k\in \{1,2\}$ and identical valuations.