کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
965692 | 1479280 | 2008 | 19 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Computability of simple games: A characterization and application to the core
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Computability of simple games: A characterization and application to the core Computability of simple games: A characterization and application to the core](/preview/png/965692.png)
چکیده انگلیسی
The class of algorithmically computable simple games (i) includes the class of games that have finite carriers and (ii) is included in the class of games that have finite winning coalitions. This paper characterizes computable games, strengthens the earlier result that computable games violate anonymity, and gives examples showing that the above inclusions are strict. It also extends Nakamura's theorem about the nonemptyness of the core and shows that computable games have a finite Nakamura number, implying that the number of alternatives that the players can deal with rationally is restricted.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Mathematical Economics - Volume 44, Issues 3â4, February 2008, Pages 348-366
Journal: Journal of Mathematical Economics - Volume 44, Issues 3â4, February 2008, Pages 348-366
نویسندگان
Masahiro Kumabe, H. Reiju Mihara,