بازی پذیرفته شدن زمانی که فضاهای پیام محدود شده اند

We consider school choice problems where students may submit only restricted length of preference lists. We propose an acyclicity condition for the priority structure of schools. When schools’ priorities are substitutable, we show that a Pareto efficient and stable assignment rule is Nash implementable by the deferred acceptance mechanism if and only if schools’ priority structures are acyclic in our sense.