Standard

Linear programming approach in cooperative games. / Zakharov, Victor V.; Kwon, O. Hun.

In: Journal of the Korean Mathematical Society, Vol. 34, No. 2, 01.12.1997, p. 469-480.

Research output: Contribution to journal › Article › peer-review

Harvard

Zakharov, VV & Kwon, OH 1997, 'Linear programming approach in cooperative games', Journal of the Korean Mathematical Society, vol. 34, no. 2, pp. 469-480.

APA

Zakharov, V. V., & Kwon, O. H. (1997). Linear programming approach in cooperative games. Journal of the Korean Mathematical Society, 34(2), 469-480.

Vancouver

Zakharov VV, Kwon OH. Linear programming approach in cooperative games. Journal of the Korean Mathematical Society. 1997 Dec 1;34(2):469-480.

Author

Zakharov, Victor V. ; Kwon, O. Hun. / Linear programming approach in cooperative games. In: Journal of the Korean Mathematical Society. 1997 ; Vol. 34, No. 2. pp. 469-480.

BibTeX

@article{8908ba069920462eb68ae0d24d9cca65,
title = "Linear programming approach in cooperative games",
abstract = "In this paper we consider TU-cooperative games in the form of characteristic function. We notice that if one uses the necessary and sufficient condition for the core to be not empty in a dual form, it may be used for selecting the final outcome in the core. Using the linear programming approach for constructing the subcore, which is a subset of the core, we represent it in a simple form. We consider reduced games due to Davis-Mashler, Moulin and Funaki and formulate the sufficient conditions for the subcore to be S-consistent.",
keywords = "Balanced game, Consis- tency, Cooperative game, Core, Subcore",
author = "Zakharov, {Victor V.} and Kwon, {O. Hun}",
year = "1997",
month = dec,
day = "1",
language = "English",
volume = "34",
pages = "469--480",
journal = "Journal of the Korean Mathematical Society",
issn = "0304-9914",
publisher = "Korean Mathematical Society",
number = "2",

}

RIS

TY - JOUR

T1 - Linear programming approach in cooperative games

AU - Zakharov, Victor V.

AU - Kwon, O. Hun

PY - 1997/12/1

Y1 - 1997/12/1

N2 - In this paper we consider TU-cooperative games in the form of characteristic function. We notice that if one uses the necessary and sufficient condition for the core to be not empty in a dual form, it may be used for selecting the final outcome in the core. Using the linear programming approach for constructing the subcore, which is a subset of the core, we represent it in a simple form. We consider reduced games due to Davis-Mashler, Moulin and Funaki and formulate the sufficient conditions for the subcore to be S-consistent.

AB - In this paper we consider TU-cooperative games in the form of characteristic function. We notice that if one uses the necessary and sufficient condition for the core to be not empty in a dual form, it may be used for selecting the final outcome in the core. Using the linear programming approach for constructing the subcore, which is a subset of the core, we represent it in a simple form. We consider reduced games due to Davis-Mashler, Moulin and Funaki and formulate the sufficient conditions for the subcore to be S-consistent.

KW - Balanced game

KW - Consis- tency

KW - Cooperative game

KW - Core

KW - Subcore

UR - http://www.scopus.com/inward/record.url?scp=53249086015&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:53249086015

VL - 34

SP - 469

EP - 480

JO - Journal of the Korean Mathematical Society

JF - Journal of the Korean Mathematical Society

SN - 0304-9914

IS - 2

ER -

ID: 40898290