报告摘要：Resource sharing serves as a major topic in economics. One of the most important issues is to divide a given resource in a fair way among rational participants. To this end quite a few fairness concepts, such as proportionality, envy-freeness, and maximin share guarantee, have been proposed. This talk starts from fair allocation of divisible items, knowns as cake cutting, by showing several fundamental results concerning about fairness. We then turn to the more difficult version with indivisible items, where the fairness is carefully relaxed in different ways. Finally, we will introduce a new model, in which the value of a set of items is determined by the induced graph structure.
专家简介：张国川，浙江大学计算机学院教授，中国运筹学会副理事长。1995年于中国科学院应用数学所获得运筹学专业博士学位。研究兴趣为组合优化近似算法、在线算法和算法机制设计。目前担任Annals of Operations Research, International Journal of Foundations of Computer Science, Journal of Scheduling, Journal of Operations Research Society of China等刊物编委。