Stable Matching with Mistaken Agents

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

Tác giả: Georgy Artemov, Yeon-Koo Che, YingHua He

Ngôn ngữ: eng

Ký hiệu phân loại: 971.411 *Canada

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

Mô tả vật lý:

Bộ sưu tập: Metadata

ID: 195584

 Motivated by growing evidence of agents' mistakes in strategically simple environments, we propose a solution concept -- robust equilibrium -- that requires only an asymptotically optimal behavior. We use it to study large random matching markets operated by the applicant-proposing Deferred Acceptance (DA). Although truth-telling is a dominant strategy, almost all applicants may be non-truthful in robust equilibrium
  however, the outcome must be arbitrarily close to the stable matching. Our results imply that one can assume truthful agents to study DA outcomes, theoretically or counterfactually. However, to estimate the preferences of mistaken agents, one should assume stable matching but not truth-telling.
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