کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6420573 | 1631798 | 2015 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Group-separations based on the repeated prisoners' dilemma games
ترجمه فارسی عنوان
جدایی گروهی بر اساس معضلات مکرر زندانیان
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
چکیده انگلیسی
We model group-separations in an n-player set. In the n-player set, every two players play an infinitely repeated two-player prisoners' dilemma game. Each player takes a mixed strategy to play the game and trigger strategy is used to punish the deviator. Let all players share a common discount factor δ. We find that with the variation of δ, the n-player set is separated into several subsets such that (1) for any two players in any two different subsets, their strategy profile is not a subgame perfect equilibrium and (2) each subset cannot be separated into several subsets that satisfy (1). Such subsets are called groups and the separation is called group-separation. We aim to specify the intervals (of δ) such that group-separations emerge. Particularly, we focus on the relationship between the interval and the form of each group-separation.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 256, 1 April 2015, Pages 267-275
Journal: Applied Mathematics and Computation - Volume 256, 1 April 2015, Pages 267-275
نویسندگان
Yuankan Huang, Takehiro Inohara,