|
Upravlenie Bol'shimi Sistemami, 2010, Issue 31.1, , Pages 5–29
(Mi ubs468)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Systems Analysis
A method for estimating the core of root game
A. N. Akimova, V. V. Zakharov St. Petersburg State University, Faculty of Applied Mathematics and Control Processes
Abstract:
It is shown that the base of the grand (shadow) subcore coincides with the core of the root game in any TU-cooperative game. Comparing the definitions of the grand subcore and the grand shadow subcore with the description of the aggregate-monotonic core leads to formal geometrical coincidence of the aggregate-monotonic core with either the grand subcore or the grand shadow subcore. The method for estimating the simplest set of equations and inequalities describing the core of a root game in a TU-game with any number of players ($n>3$) is proposed. To develop the method the duality theory and an 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:
A. N. Akimova, V. V. Zakharov, “A method for estimating the core of root game”, UBS, 31.1 (2010), 5–29
Linking options:
https://www.mathnet.ru/eng/ubs468 https://www.mathnet.ru/eng/ubs/v31/i1/p5
|
Statistics & downloads: |
Abstract page: | 262 | Full-text PDF : | 290 | References: | 34 |
|