<p>This study pursues how waitlists should be designed to achieve desirable outcomes in object allocation models with outside option. We adapt the usual stability notion to our setting and call it “<i>sure stability</i>." Our first mechanism—Deferred Acceptance with Straightforward Waitlists (<i>DSW</i>)—is surely stable, and it dominates other surely stable mechanisms unless waitlists are capped, otherwise, it is not even constrained efficient. Given this inefficiency of <i>DSW</i>, we propose <i>Deferred Acceptance with Augmented Waitlists </i>(<i>DAW</i>) mechanism. It is surely stable and improves <i>DSW</i>. Sure stability is incompatible with strategy-proofness, hence both mechanisms are manipulable. We also show that increasing the waitlist capacities is always at least weakly welfare-improving under each of them.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Waitlist engineering in discrete object allocations with outside option

  • Mustafa Oğuz Afacan,
  • Eray Cumbul

摘要

This study pursues how waitlists should be designed to achieve desirable outcomes in object allocation models with outside option. We adapt the usual stability notion to our setting and call it “sure stability." Our first mechanism—Deferred Acceptance with Straightforward Waitlists (DSW)—is surely stable, and it dominates other surely stable mechanisms unless waitlists are capped, otherwise, it is not even constrained efficient. Given this inefficiency of DSW, we propose Deferred Acceptance with Augmented Waitlists (DAW) mechanism. It is surely stable and improves DSW. Sure stability is incompatible with strategy-proofness, hence both mechanisms are manipulable. We also show that increasing the waitlist capacities is always at least weakly welfare-improving under each of them.