合作与竞争公平分配中最大最小分配的计算
最优化与控制
2017-03-24 v3 计算机科学与博弈论
概率论
摘要
我们考虑了在竞争与合作两种策略背景下，完全可分物品的最大最小分配的上界和下界。随后，我们推导出一种次梯度算法，以计算精确值至任意固定精度。
引用
@article{arxiv.1110.4241,
title = {Finding maxmin allocations in cooperative and competitive fair division},
author = {Marco Dall'Aglio and Camilla Di Luca},
journal= {arXiv preprint arXiv:1110.4241},
year = {2017}
}
备注
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)