کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
7368078 | 1479271 | 2011 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
The computational complexity of rationalizing boundedly rational choice behavior
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
We determine the computational complexity of various choice models that use multiple rationales to explain observed choice behavior. First, we demonstrate that the notion of rationalizability by K rationales, introduced by Kalai et al. (2002), is NP-complete for K greater than or equal to two. Then, we show that the question of sequential rationalizability by K rationales, introduced by Manzini and Mariotti (2007), is NP-complete for K greater than or equal to three. Finally, we focus on the computational complexity of two models that refine this model of sequential choice behavior. We establish that the model of choice by game trees, from Xu and Zhou (2007), is NP-complete while the status-quo bias model, from Masatlioglu and Ok (2005), can be verified in polynomial time.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Mathematical Economics - Volume 47, Issues 4â5, AugustâOctober 2011, Pages 425-433
Journal: Journal of Mathematical Economics - Volume 47, Issues 4â5, AugustâOctober 2011, Pages 425-433
نویسندگان
Thomas Demuynck,