کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
478615 | 1446115 | 2010 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
An algorithm for computing the nucleolus of disjunctive non-negative additive games with an acyclic permission structure
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
A cooperative game with a permission structure describes a situation in which players in a cooperative TU-game are hierarchically ordered in the sense that there are players that need permission from other players before they are allowed to cooperate. In this paper we consider non-negative additive games with an acyclic permission structure. For such a game we provide a polynomial time algorithm for computing the nucleolus of the induced restricted game. The algorithm is applied to a market situation where sellers can sell objects to buyers through a directed network of intermediaries.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 207, Issue 2, 1 December 2010, Pages 817–826
Journal: European Journal of Operational Research - Volume 207, Issue 2, 1 December 2010, Pages 817–826
نویسندگان
René van den Brink, Ilya Katsev, Gerard van der Laan,