Deciding whether a given allocation is 1-of-n MMS is co-NP complete for agents with additive preferences.

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

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