首页 | 本学科首页   官方微博 | 高级检索  
     检索      

弱偏好序下带容量房屋匹配混合模型的机制设计
引用本文:吴威让,陈金阳,翁亚兰.弱偏好序下带容量房屋匹配混合模型的机制设计[J].运筹学学报,2015,19(2):111-126.
作者姓名:吴威让  陈金阳  翁亚兰
作者单位:1. 湖北师范学院数学与统计学院, 湖北黄石\,435002
摘    要:研究弱偏好序下, 带容量房屋市场混合模型(CHMTeT)的机制设计问题, 并针对该模型提出了一类算法机制, 该机制是TTC算法机制的推广, 称之为剔除筛选算法(简记为CTTC)机制. 此外, 证明了CHMTeT模型应用CTTC算法得到的这一类机制(即CTTC机制)满足个人理性、帕累托有效性和防策略操纵性, 并得出CTTC算法的时间复杂度为O(n_{1}^{2}\\(n_{1}n_{2}+n_{2}^{2})), 其中n_{1}为参与人数, n_{2}为房子数.

关 键 词:房屋分配  弹性  虚拟参与人  帕累托有效性  防策略操纵性  
收稿时间:2013-05-04

Capacitated house market model with tenant under weak preferences
WU Weirang,CHEN Jinyang,WENG Yalan.Capacitated house market model with tenant under weak preferences[J].OR Transactions,2015,19(2):111-126.
Authors:WU Weirang  CHEN Jinyang  WENG Yalan
Institution:1. College of Mathematics and Statistics, Hubei Normal University, Huangshi 435002, Hubei, China
Abstract:In this paper, the capacitated house market model with tenant under weak preferences problem has been considered. According to this model, we propose a kind of algorithm mechanism which is the extension of TTC algorithm, known as the Remove Selection algorithm(called CTTC) mechanism. In addition, we show that this kind of mechanism by using CTTC of the model satisfies individual rationality, Pareto-efficient and strategy-proof, and the complexity of CTTC algorithm is O(n_{1}^{2}(n_{1}n_{2}+n_{2}^{2})), where n_{1} is the number of agents, n_{2} is the number of the house.
Keywords:house allocation  elasticity  virtual participants  Pareto-efficient  strategy-proof
本文献已被 CNKI 等数据库收录!
点击此处可从《运筹学学报》浏览原始摘要信息
点击此处可从《运筹学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号