席位分配问题的一种新算法  

A New Method For Seats Distribution Problem

作　　者：贺明峰[1] 陈俐羽[2] 于柄林[2] 

机构地区：[1]大连理工大学应用数学系,辽宁大连116023 [2]大连理工大学大学生创新院,辽宁大连116023

出　　处：《数学的实践与认识》2007年第4期83-87,共5页Mathematics in Practice and Theory

摘　　要：讨论了席位分配问题的已有方法与H.P.Y oung公理体系中公理4之间的关系.通过数据算例指出已有方法都不能使公理4与极差最小同时满足.据此,我们建立了在满足公理4的前提下的最小极差法.This paper discusses the relationship between the presented methods for seats distribution problem and the forth theory that set up by H. P. Young. Through a large number of numerical experiments, we find that all the presented methods can＇t satisfy both the forth theory and the minimum differences of poles. According to this, we set up a method called minimum differences of poles based on the forth theory.

关 键 词：席位分配 最小极差 公理体系 相对公平 算法 

分 类 号：O157[理学—数学]