On Two Competing Mechanisms for Priority-based Allocation Problems with General Weak Priorities
On Two Competing Mechanisms for Priority-based Allocation Problems with General Weak Priorities
复制标题
一般弱优先级基于优先级的分配问题的两种竞争机制
DOI：
10.2139/ssrn.3098685
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
Wataru Ishida
中科院分区：
文献类型：
--
作者：
Wataru Ishida
我们考虑了一个具有一般弱优先级的基于优先级的分配问题。我们重点研究了两种策略防范机制：延期承兑(DA)机制和顶峰交易周期(TTC)机制。我们给出了弱优先结构的两个条件，使得任意固定平局规则的DA机制和TTC机制都是稳定和有效的。我们的条件是Ergin(2002年)的S和Kesten(2006)的S关于严格优先级的条件的推广。我们的两个条件并不相互暗示，而众所周知Kesten的条件蕴含着Ergin的条件。我们的分析表明，对于比Ehler和Erdil(2010)更大的优先级结构域，可以从稳定和有效的匹配中进行无策略的选择。
We consider a priority based allocation problem with general weak priorities. We focus on two strategy-proof mechanisms: the deferred acceptance (DA) mechanism and the top trading cycles (TTC) mechanism. We give two conditions on weak priority structures whereby each of the DA mechanism and TTC mechanism with an arbitrarily fixed tie-breaking rule is stable and efficient. Our conditions are a generalization of each of Ergin (2002) 's and Kesten (2006)'s conditions about strict priorities. Our two conditions do not imply each other, whereas it is known that Kesten's condition implies Ergin's condition. Our analysis shows that a strategy-proof selection from stable and efficient matchings can be done for a larger domain of priority structures than the domain of Ehlers and Erdil (2010).
剑桥:剑桥大学出版社
DOI：
--
发表时间：
--
期刊：
影响因子：
--
作者：
Shirai;Y.. Aspect. In P. C. Hogan (Ed.)
通讯作者：
Y.. Aspect. In P. C. Hogan (Ed.)