|
Matematicheskaya Teoriya Igr i Ee Prilozheniya, 2010, Volume 2, Issue 1, Pages 3–26
(Mi mgta27)
|
|
|
|
A method for estimating the core of root game
Arina N. Akimova, Viktor V. Zakharov Faculty of Applied Mathematics and Control Processes, St. Petersburg State University
Abstract:
It is showen that the base of grand (shadow) subcore coincides with the core of the root game in any TU-cooperative game. Comparing definitions of grand subcore and grand shadow subcore with description of aggregate-monotonic core leads to the formal geometrical coincidence of aggregate-monotonic core with either grand subcore or grand shadow subcore. The method for estimating the simplest set of equations and inequalities describing the core of a root game in TU-game with any number of players ($n\ge3$) is proposed. To develop the method dual theory and inductive method by B. Peleg are used.
Keywords:
TU-cooperative game, core, grand (shadow) subcore, root game, aggregate-monotonic core, linear programming, balanced collection of coalitions.
Citation:
Arina N. Akimova, Viktor V. Zakharov, “A method for estimating the core of root game”, Mat. Teor. Igr Pril., 2:1 (2010), 3–26
Linking options:
https://www.mathnet.ru/eng/mgta27 https://www.mathnet.ru/eng/mgta/v2/i1/p3
|
Statistics & downloads: |
Abstract page: | 516 | Full-text PDF : | 137 | References: | 48 | First page: | 1 |
|