How much can fair budget-division rules resist manipulation?

How much can fair budget-division rules resist manipulation? In our paper, we ask what the best achievable compromise is. We prove that the Nash product rule reaches the optimal frontier. We study settings in which a fixed, divisible resource must be distributed among candidates or projects. The resource might be public money, research funding, charitable donations or even screen time.