Minimal-envy Conference Paper Assignment: Formulation and a Fast Iterative Algorithm

Author:

Tan Mao1,Dai Zhuocen2,Ren Yuling2,Walsh Toby3,Aleksandrov Martin4

Affiliation:

1. Xiangtan University,Hunan National Center for Applied Mathematics,Xiangtan,China

2. Xiangtan University,School of Computer Science,Xiangtan,China

3. University of New South Wales,School of Computer Science and Engineering,Sydney,Australia

4. Institute of Software Engineering and Theoretical Computer Science Technical University Berlin,Berlin,Germany

Publisher

IEEE

Reference28 articles.

1. The ai conference paper assignment problem;goldsmith;Proc AAAI Workshop on Preference Handling for Artificial Intelligence,2007

2. Paper Matching with Local Fairness Constraints

3. Negative-weight shortest paths and unit capacity minimum cost flow in ildeO(m10/7logw) time;cohen;Twenty-eighth Acm-siam Symposium on Discrete Algorithms,2016

4. Distributed fair allocation of indivisible goods

5. Fair Allocation of Indivisible Goods

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3