Standard

Nucleolus as a Selector of Subcore. / Zakharov, V.V.; Akimova, A.N.

11th IFAC Workshop on Control Applications of Optimization 2000, St Petersburg, Russia, 3-6 July 2000. Elsevier, 2000. p. 675-680 (IFAC Proceedings Volumes; Vol. 33, No. 16).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research

Harvard

Zakharov, VV & Akimova, AN 2000, Nucleolus as a Selector of Subcore. in 11th IFAC Workshop on Control Applications of Optimization 2000, St Petersburg, Russia, 3-6 July 2000. IFAC Proceedings Volumes, no. 16, vol. 33, Elsevier, pp. 675-680, 11th IFAC Workshop on Control Applications of Optimization (CAO 2000), Санкт-Петербург, Russian Federation, 3/07/00. https://doi.org/10.1016/S1474-6670(17)39714-8

APA

Zakharov, V. V., & Akimova, A. N. (2000). Nucleolus as a Selector of Subcore. In 11th IFAC Workshop on Control Applications of Optimization 2000, St Petersburg, Russia, 3-6 July 2000 (pp. 675-680). (IFAC Proceedings Volumes; Vol. 33, No. 16). Elsevier. https://doi.org/10.1016/S1474-6670(17)39714-8

Vancouver

Zakharov VV, Akimova AN. Nucleolus as a Selector of Subcore. In 11th IFAC Workshop on Control Applications of Optimization 2000, St Petersburg, Russia, 3-6 July 2000. Elsevier. 2000. p. 675-680. (IFAC Proceedings Volumes; 16). https://doi.org/10.1016/S1474-6670(17)39714-8

Author

Zakharov, V.V. ; Akimova, A.N. / Nucleolus as a Selector of Subcore. 11th IFAC Workshop on Control Applications of Optimization 2000, St Petersburg, Russia, 3-6 July 2000. Elsevier, 2000. pp. 675-680 (IFAC Proceedings Volumes; 16).

BibTeX

@inproceedings{5103318a3fae4b24ba5656d38b6077c4,
title = "Nucleolus as a Selector of Subcore",
abstract = "In this paper TU-cooperative games are considered from the linear programming point of view. Using the linear programming approach for construction of subcore and grand subcore, which are multiple selectors of the core, we represent them in analytical forms. The investigation of subcore's properties illustrates the possibility to obtain more simple conditions to check whether an arbitrary one point solution lies in the core and subcore. Two solution concepts for cooperative games in characteristic-function form, the nucleolus and Shapley value, are studied in their relationship to the grand subcore in symmetrical n-person TU-cooperative games. Under additional restrictions for the structure of optimal solutions{\textquoteright} set of considered linear programming problem sufficient conditions have been obtained for the nucleolus to be a selector of the grand subcore.",
keywords = "co-operation, game theory, linear programming",
author = "V.V. Zakharov and A.N. Akimova",
year = "2000",
doi = "10.1016/S1474-6670(17)39714-8",
language = "English",
series = "IFAC Proceedings Volumes",
publisher = "Elsevier",
number = "16",
pages = "675--680",
booktitle = "11th IFAC Workshop on Control Applications of Optimization 2000, St Petersburg, Russia, 3-6 July 2000",
address = "Netherlands",
note = "11th IFAC Workshop on Control Applications of Optimization (CAO 2000), CAO 2000 ; Conference date: 03-07-2000 Through 06-07-2000",

}

RIS

TY - GEN

T1 - Nucleolus as a Selector of Subcore

AU - Zakharov, V.V.

AU - Akimova, A.N.

N1 - Conference code: 11

PY - 2000

Y1 - 2000

N2 - In this paper TU-cooperative games are considered from the linear programming point of view. Using the linear programming approach for construction of subcore and grand subcore, which are multiple selectors of the core, we represent them in analytical forms. The investigation of subcore's properties illustrates the possibility to obtain more simple conditions to check whether an arbitrary one point solution lies in the core and subcore. Two solution concepts for cooperative games in characteristic-function form, the nucleolus and Shapley value, are studied in their relationship to the grand subcore in symmetrical n-person TU-cooperative games. Under additional restrictions for the structure of optimal solutions’ set of considered linear programming problem sufficient conditions have been obtained for the nucleolus to be a selector of the grand subcore.

AB - In this paper TU-cooperative games are considered from the linear programming point of view. Using the linear programming approach for construction of subcore and grand subcore, which are multiple selectors of the core, we represent them in analytical forms. The investigation of subcore's properties illustrates the possibility to obtain more simple conditions to check whether an arbitrary one point solution lies in the core and subcore. Two solution concepts for cooperative games in characteristic-function form, the nucleolus and Shapley value, are studied in their relationship to the grand subcore in symmetrical n-person TU-cooperative games. Under additional restrictions for the structure of optimal solutions’ set of considered linear programming problem sufficient conditions have been obtained for the nucleolus to be a selector of the grand subcore.

KW - co-operation

KW - game theory

KW - linear programming

U2 - 10.1016/S1474-6670(17)39714-8

DO - 10.1016/S1474-6670(17)39714-8

M3 - Conference contribution

T3 - IFAC Proceedings Volumes

SP - 675

EP - 680

BT - 11th IFAC Workshop on Control Applications of Optimization 2000, St Petersburg, Russia, 3-6 July 2000

PB - Elsevier

T2 - 11th IFAC Workshop on Control Applications of Optimization (CAO 2000)

Y2 - 3 July 2000 through 6 July 2000

ER -

ID: 26453156