Calculating the 1-of-n MMS of a given agent is NP-hard even if all agents have additive preferences (reduction from partition problem).

Open the “1. Computational complexity” section on Wikipedia →

Source: List of unsolved problems in fair division (CC BY-SA 4.0)