Finding Maxmin Allocations in Cooperative and Competitive Fair Division
| dc.creator | Dall'Aglio, Marco | |
| dc.creator | Di Luca, Camilla | |
| dc.date | 2017-04-01T17:51:13Z | |
| dc.date.accessioned | 2026-07-09T05:55:06Z | |
| dc.description | 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. | |
| dc.identifier | doi:10.22004/ag.econ.120020 | |
| dc.identifier | https://ageconsearch.umn.edu/record/120020/files/NDL2011-088.pdf | |
| dc.identifier | http://ageconsearch.umn.edu/record/120020 | |
| dc.identifier.uri | http://hdl.handle.net/123456789/570020 | |
| dc.language | eng | |
| dc.publisher | ||
| dc.source | http://ageconsearch.umn.edu/record/120020 | |
| dc.title | Finding Maxmin Allocations in Cooperative and Competitive Fair Division | |
| dc.type | Text |