On Stable Algorithms for Two-Sided Matching with Information Diffusion

DOI

Bibliographic Information

Other Title
  • 情報伝播付き両方向マッチングのための安定アルゴリズムに関する検討

Description

<p>It is known that there is no stable algorithm that satisfy strategy-proofness in the two-sided matching with information diffusion. In this research, we examine the existence of stable algorithms by weakening the incentive requirement. More precisely, we show that even the non-obvious manipulability property is not achievable by stable algorithms.</p>

Journal

Keywords

Details 詳細情報について

Report a problem

Back to top