کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10347869 | 699371 | 2013 | 6 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Finding the nucleolus of any n-person cooperative game by a single linear program
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Finding the nucleolus of any n-person cooperative game by a single linear program Finding the nucleolus of any n-person cooperative game by a single linear program](/preview/png/10347869.png)
چکیده انگلیسی
In this paper we show a new method for calculating the nucleolus by solving a unique minimization linear program with O(4n) constraints whose coefficients belong to {â1,0,1}. We discuss the need of having all these constraints and empirically prove that they can be reduced to O(kmax2n), where kmax is a positive integer comparable with the number of players. A computational experience shows the applicability of our method over (pseudo)random transferable utility cooperative games with up to 18 players.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 40, Issue 10, October 2013, Pages 2308-2313
Journal: Computers & Operations Research - Volume 40, Issue 10, October 2013, Pages 2308-2313
نویسندگان
Justo Puerto, Federico Perea,