Equivalence and strategy-proofness of non-anonymous priority allotment mechanisms
- 作者: Korgin N.A.1
-
隶属关系:
- Trapeznikov Institute of Control Sciences
- 期: 卷 77, 编号 11 (2016)
- 页面: 2065-2079
- 栏目: Mathematical Game Theory and Applications
- URL: https://journals.rcsi.science/0005-1179/article/view/150484
- DOI: https://doi.org/10.1134/S000511791611014X
- ID: 150484
如何引用文章
详细
This paper gives an analytical characterization for the strategy-proof sequential allotment mechanisms of a limited resource that are equivalent to the straight and reverse priority mechanisms. The previously known equivalence of the anonymous priority mechanisms is extended to the non-anonymous case by establishing the following fact: for an arbitrary straight priority mechanism, there exists an equivalent reverse priority mechanism, but the converse fails. And finally, we provide a characterization for the class of reverse priority mechanisms having an equivalent straight priority mechanism.
作者简介
N. Korgin
Trapeznikov Institute of Control Sciences
编辑信件的主要联系方式.
Email: nkorgin@ipu.ru
俄罗斯联邦, Moscow
补充文件
