  Allocating resources to individuals in a fair manner has been a topic of
interest since the ancient times, with most of the early rigorous mathematical
work on the problem focusing on infinitely divisible resources. Recently, there
has been a surge of papers studying computational questions regarding various
different notions of fairness for the indivisible case, like maximin share
fairness (MMS) and envy-freeness up to any good (EFX). We survey the most
important results in the discrete fair division literature, focusing on the
case of additive valuation functions and paying particular attention to the
progress made in the last 10 years.
