Showing 1 - 10 of 44
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
Persistent link: https://www.econbiz.de/10013112094
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...
Persistent link: https://www.econbiz.de/10009380614
Persistent link: https://www.econbiz.de/10010470996
Persistent link: https://www.econbiz.de/10000947006
Persistent link: https://www.econbiz.de/10000947007
Persistent link: https://www.econbiz.de/10000947008
Persistent link: https://www.econbiz.de/10000952741
Persistent link: https://www.econbiz.de/10000952743
Persistent link: https://www.econbiz.de/10001599914
Persistent link: https://www.econbiz.de/10001612262