Almost envy-free allocations of unweighted items
Author:
Publisher
Science China Press., Co. Ltd.
Subject
Engineering (miscellaneous),General Computer Science
Link
https://engine.scichina.com/doi/pdf/3DCB298F19A941FBA446FCA12EB66231
Reference24 articles.
1. Budish E. The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes. J Political Economy, 2011, 119: 1061-1103.
2. Caragiannis I, Kurokawa D, Moulin H, et al. The unreasonable fairness of maximum Nash welfare. In: Proceedings of the ACM Conference on Economics and Computation, Maastricht, 2016. 305--322.
3. Plaut B, Roughgarden T. Almost envy-freeness with general valuations. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, 2018. 2584--2603.
4. Kyropoulou M, Suksompong W, Voudouris A A. Almost envy-freeness in group resource allocation. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence, Macao, 2019. 400--406.
5. Aziz H, Rauchecker G, Schryen G, et al. Algorithms for max-min share fair allocation of indivisible chores. In: Proceedings of the 31st AAAI Conference on Artificial Intelligence, San Francisco, 2017. 335--341.
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3