Fair Division

See this page for an introduction to fair division.

We depict implications between fairness notions as a DAG. Each fairness notion is a vertex and there is an edge from a notion F1 to notion F2 iff F1 implies F2. Feasible notions are colored green and infeasible notions are colored red. There is a 'speculative edge' from F1 to F2 if it is not known whether F1 implies F2.

The implication DAG can be generated under different assumptions on the agents' valuations by picking appropriate values from the dropdowns and checking appropriate checkboxes.

The implication DAG can also be restricted to certain fairness notions selected by the user. If no fairness notions are selected, then all are included in the DAG. If at most one or two fairness notions are selected, then proofs of feasibility/infeasibility and implication are also displayed.

Links to implication graph applications:

  1. Fair cake division.
  2. Indivisible items.