Characterizing Permissibility, Proper Rationalizability, and Iterated Admissibility by Incomplete Information

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

Tác giả: Shuige Liu

Ngôn ngữ: eng

Ký hiệu phân loại: 121.2 Possibility and limits of knowledge

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

Mô tả vật lý:

Bộ sưu tập: Metadata

ID: 162349

Comment: arXiv admin note: substantial text overlap with arXiv:1801.04714We characterize three interrelated concepts in epistemic game theory: permissibility, proper rationalizability, and iterated admissibility. We define the lexicographic epistemic model for a game with incomplete information. Based on it, we give two groups of characterizations. The first group characterizes permissibility and proper rationalizability. The second group characterizes permissibility in an alternative way and iterated admissibility. In each group, the conditions for the latter are stronger than those for the former, which corresponds to the fact that proper rationalizability and iterated admissibility are two (compatible) refinements of permissibility within the complete information framework. The intrinsic difference between the two groups are the role of rationality: the first group does not need it, while the second group does.
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