讲座预告 | On the Complexity of Maximizing Social Welfare...
Time:Tuesday, Aug.16, 13:30--14:30
Tencent Meeting ID:853-8759-9058;PW:123456
1. 主讲人介绍
Biaoshuai Tao is an assistant professor at John Hopcroft Center for Computer Science at Shanghai Jiao Tong University since 2020. In 2020, he received his Ph.D. degree in computer science at the University of Michigan, Ann Arbor. His research interests mainly include the interdisciplinary area between theoretical computer science and economics, including social network analyses, resource allocation problems, and algorithmic game theory. Before joining the University of Michigan, Biaoshuai was employed as a project officer at Nanyang Technological University in Singapore from 2012 to 2015, and he received the B.S. degree in mathematical science with a minor in computing from Nanyang Technological University in 2012.
2. 讲座介绍
Title:
On the Complexity of Maximizing Social Welfare within Fair Allocations of Indivisible Goods
Abstract:
Fair division is a classical topic studied in various disciplines and captures many real applications. One important issue in fair division is to cope with (economic) efficiency and fairness. A natural question along this direction that receives considerable attention is: How to obtain the most efficient allocations among all the fair allocations? We study the complexity of maximizing social welfare within envy-free up to one item (EF1) allocations of indivisible goods for both normalized and unnormalized valuations. With two agents, we show a fully polynomial time approximation scheme (FPTAS) and complement this positive result with the NP-hardness result where the latter resolves an open problem raised by the previous work. Further, when the number of agents n is a constant, we provide a bi-criteria algorithm that finds the optimal social welfare while relaxing EF1 by a factor arbitrarily close to 1. We complement this by providing several strong inapproximability results if EF1 is not allowed to relax. In particular, we demonstrate that the inapproximability becomes stronger as n increases. Last, we consider the case with general number of agents. In this case, we give a variant of the round-robin algorithm with an approximation ratio of
This is a joint work with Xiaolin Bu, Zihao Li, Shengxin Liu, and Jiaxin Song.
(本文转载自上海财经大学 ,如有侵权请电话联系13810995524)
* 文章为作者独立观点,不代表MBAChina立场。采编部邮箱:news@mbachina.com,欢迎交流与合作。
热门推荐
备考交流
最新动态
- 信息管理与工程学院 | 上海财经大学2024年MEM项目(非全日制)调剂通知 2024-03-30
- 24招生 | 上海财经大学2024年工程管理硕士(MEM)(非全日制)招生简章 2023-10-23
- 上海财经大学讲座回顾|人工智能技术在经管领域的应用 2023-04-17
活动日历
- 01月
- 02月
- 03月
- 04月
- 05月
- 06月
- 07月
- 08月
- 09月
- 10月
- 11月
- 12月
- 05/04 报名 | “中国经济变局下的企业风险管理”复旦大学李若山教授公开课暨联合宣讲会
- 05/08 集赞赢取精美礼品 | 面试诀窍、备考经历、海外交换,报名5月8日面试圆桌派,用10个问题揭秘三位高分学长的备考秘籍!
- 05/11 报名 | “企业数据资产盈利的商业模式”复旦大学教授公开课暨项目招生说明会
- 05/12 招生工作|浙工大校园开放日暨MBA、MEM项目宣讲会通知
- 05/12 「复旦大学 EMBA 项目」与「复旦-台大 EMBA 项目」介绍会 | 活动预告
- 05/12 香港大学MBA大师级示范课 | 双剑合璧,对话未来,一起再飞跃!
- 05/15 提速您的职业发展之旅|报名5月15日港科大MBA线上招生分享活动
- 05/17 限时抢位!长江商学院MBA项目5月北京体验课
- 05/18 西交利物浦大学IMBA公开课 | 颠覆性的市场环境将为领导力带来哪些挑战?
- 05/18 第二期校园体验日开放报名 | 学长学姐带你感受你最想知道的华东师大MBA!
热门资讯
MBA院校号
-
最新动态:
华南农业大学2023年调剂说明