紀要論文

定員制約を持つ配属問題に対するマッチングメカニズムの設計と性能分析

Design and Analysis of Matching Mechanism for Quota Constraints

jpn

24321192

https://doi.org/10.15002/00021949

法政大学大学院情報科学研究科

法政大学大学院紀要. 情報科学研究科編

14

1

6

2019-03-31

Version of Record

Research on matching problems is one of the spotlighting areas of game theoretic mechanism design. In the matching problems where a set of preferable assignments is determined for both laboratory and students who have preferences for each other, fairness, non-wastefulness, and strategy-proofness (SP) are used as evaluation criteria. In previous researches, DA, PLDA-RQ, SDRQ, MSDARQ and ADA was proposed corresponding to those under hierarchical regional constraint. These mechanisms decide assignments by using priority orders, PL and ML. Many complaints arise when the order doesn‘t suit to actual preferences. This paper first proposes a mechanism to take an approach to bring a priority order closer to that of the actual preferences, PLDA-r2, PLDA-Div. These mechanisms, involving the proposed mechanisms, however only deal with one-time assignment. In another word, they can’t solve the problem of determining multiple assignments without duplication. Therefore, I expand the model and propose a criterion formula whether it is possible to assign them multiple times. Then, I propose a mechanism corresponding to twice assignment problem, SDTA, which uses the criterion formula and an idea of SDRQ. I evaluate it through simulation experiments to compare the validity of proposed mechanism with the previous mechanism.

Article

AA12746425