2011/10/31 by Marco Dall’Aglio, Marco Dall'Aglio, Camilla Di Luca
Computer Science · Decision Sciences · Economics, Econometrics and Finance · Mathematics · #Arithmetic #Auction Theory and Applications #Business #Computer science #Division (mathematics) #Economics #Fair division #Game Theory and Applications #Game Theory and Voting Systems #Mathematics #Microeconomics #cs.GT #math.OC #math.PR
paper · pdf · doi:10.1007/s10479-014-1611-9
published as Ann. Oper. Res. 223 (2014), 121--136 · 20 pages, 3 figures. This third version improves the overll presentation; Optimization and Control (math.OC), Computer Science and Game Theory (cs.GT), Probability (math.PR)
arxiv created 2012/08/10 · openalex publication_date 2014/06/26 · openalex created_date 2016/06/24 · arxiv updated 2017/03/24 · openalex updated_date 2026/08/05
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.