Combining Outcome-Based and Preference-Based Matching: A Constrained Priority Mechanism

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

Tác giả: Avidit Acharya, Kirk Bansak, Jens Hainmueller

Ngôn ngữ: eng

Ký hiệu phân loại: 302.13 Social choice

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

Mô tả vật lý:

Bộ sưu tập: Báo, Tạp chí

ID: 162635

Comment: This manuscript has been accepted for publication by Political Analysis and will appear in a revised form subject to peer review and/or input from the journal's editor. End-users of this manuscript may only make use of it for private research and study and may not distribute it furtherWe introduce a constrained priority mechanism that combines outcome-based matching from machine-learning with preference-based allocation schemes common in market design. Using real-world data, we illustrate how our mechanism could be applied to the assignment of refugee families to host country locations, and kindergarteners to schools. Our mechanism allows a planner to first specify a threshold $\bar g$ for the minimum acceptable average outcome score that should be achieved by the assignment. In the refugee matching context, this score corresponds to the predicted probability of employment, while in the student assignment context it corresponds to standardized test scores. The mechanism is a priority mechanism that considers both outcomes and preferences by assigning agents (refugee families, students) based on their preferences, but subject to meeting the planner's specified threshold. The mechanism is both strategy-proof and constrained efficient in that it always generates a matching that is not Pareto dominated by any other matching that respects the planner's threshold.
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