Incontestable Assignments

 0 Người đánh giá. Xếp hạng trung bình 0

Tác giả: Benoit Decerf, Guillaume Haeringer, Martin Van der Linden

Ngôn ngữ: eng

Ký hiệu phân loại: 341.55 +Adjudication

Thông tin xuất bản: 2024

Mô tả vật lý:

Bộ sưu tập: Metadata

ID: 201183

In school districts where assignments are exclusively determined by a clearinghouse students can only appeal their assignment with a valid reason. An assignment is incontestable if it is appeal-proof. We study incontestability when students do not observe the other students' preferences and assignments. Incontestability is shown to be equivalent to individual rationality, non-wastefulness, and respect for top-priority sets (a weakening of justified envy). Stable mechanisms and those Pareto dominating them are incontestable, as well as the Top-Trading Cycle mechanism (but Boston is not). Under a mild consistency property, incontestable mechanisms are i-indinstiguishable (Li, 2017), and share similar incentive properties.
Tạo bộ sưu tập với mã QR

THƯ VIỆN - TRƯỜNG ĐẠI HỌC CÔNG NGHỆ TP.HCM

ĐT: (028) 36225755 | Email: tt.thuvien@hutech.edu.vn

Copyright @2024 THƯ VIỆN HUTECH