运筹学学报 ›› 2015, Vol. 19 ›› Issue (2): 111-126.doi: 10.15960/j.cnki.issn.1007-6093.2015.02.013

• 运筹学 • 上一篇    

弱偏好序下带容量房屋匹配混合模型的机制设计

吴威让1,陈金阳1,*,翁亚兰1   

  1. 1. 湖北师范学院数学与统计学院, 湖北黄石\,435002
  • 收稿日期:2013-05-04 出版日期:2015-06-15 发布日期:2015-06-15
  • 通讯作者: 陈金阳 cjypp7014@126.com
  • 基金资助:

    国家自然科学基金(Nos. 61304057, 11471105)

Capacitated house market model with tenant under weak preferences

WU Weirang1,CHEN Jinyang1,*,WENG Yalan1   

  1. 1. College of Mathematics and Statistics, Hubei Normal University, Huangshi 435002, Hubei, China
  • Received:2013-05-04 Online:2015-06-15 Published:2015-06-15

摘要:

研究弱偏好序下, 带容量房屋市场混合模型(CHMTeT)的机制设计问题, 并针对该模型提出了一类算法机制, 该机制是TTC算法机制的推广, 称之为剔除筛选算法(简记为CTTC)机制. 此外, 证明了CHMTeT模型应用CTTC算法得到的这一类机制(即CTTC机制)满足个人理性、帕累托有效性和防策略操纵性, 并得出CTTC算法的时间复杂度为O(n_{1}^{2}\\(n_{1}n_{2}+n_{2}^{2})), 其中n_{1}为参与人数, n_{2}为房子数.

关键词: 房屋分配, 弹性, 虚拟参与人, 帕累托有效性, 防策略操纵性

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.

Key words: house allocation, elasticity, virtual participants, Pareto-efficient, strategy-proof