We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision. -- Fair Division ; Maxmin Allocation ; Kalai...

Mankind must cooperate to reduce GHG emissions to prevent a catastrophic rise in global temperature. How can the necessary costs of reducing GHG emissions be allocated across regions of the world, within the next few generations, and simultaneously address growth expectations and economic...

We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision

Several authors in the economics literature have referred to Kantian behavior, informally, as a kind of cooperation. We model this notion precisely, and define two kinds of Kantian allocation. An set of strategies by players is Kantian if, informally, no player would advocate that all players...