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.

Open the “Runtime complexity of fair allocation with bounded sharing” section on Wikipedia →

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