登入選單
返回Google圖書搜尋
School Choice with Controlled Choice Constraints
其他書名
Hard Bounds Versus Soft Bounds
出版SSRN, 2014
URLhttp://books.google.com.hk/books?id=9bfizwEACAAJ&hl=&source=gbs_api
註釋Controlled choice over public schools attempts giving parents selection options while maintaining diversity of di fferent student types. In practice, diversity constraints are often enforced by setting hard upper bounds and hard lower bounds for each student type. We demonstrate that, with hard bounds, there might not exist assignments that satisfy standard fairness and non-wastefulness properties; and only constrained non-wasteful assignments which are fair for same type students can be guaranteed to exist. We introduce the student exchange algorithm with hard bounds (SEAHB) that finds a Pareto optimal assignment among such assignments. To achieve fair (across all types) and non-wasteful assignments, we propose the control constraints to be interpreted as soft bounds- flexible limits that regulate school priorities dynamically. In this setting, the deferred acceptance algorithm with soft bounds (DAASB) finds an assignment that is Pareto optimal among fair assignments while eliciting true preferences. Thus, we demonstrate DAASB has clear benefi ts over SEAHB.