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

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...

This paper analyzes grading competition between instructors of elective courses when students shop for high course scores, the instructors maximize class size, and the school imposes a ceiling on mean course scores to limit grade inflation. Under this grading norm, we demonstrate that curriculum...

Is competition perceived as a fair procedure? We report data from laboratory experiments where a powerful buyer can trade with one of several sellers. Sellers who feel shortchanged can engage in counterproductive behavior to punish the buyer. We find that the same unfavorable terms of trade...

Is competition perceived as a fair procedure? We report data from laboratory experiments where a powerful buyer can trade with one of several sellers. Sellers who feel shortchanged can engage in counterproductive behavior to punish the buyer. We find that the same unfavorable terms of trade...

Is competition perceived as a fair procedure? We report data from laboratory experiments where a powerful buyer can trade with one of several sellers. Sellers who feel shortchanged can engage in counterproductive behavior to punish the buyer. We find that the same unfavorable terms of trade...