A Short Proof of the Inclusion of the Core in the Weber Set

J. Derks

doi:10.1007/BF01245457

A Short Proof of the Inclusion of the Core in the Weber Set

J. Derks^*

^*Corresponding author for this work

Department of Advanced Computing Sciences

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

Abstract

For a transferable utility game the convex hull of the Weber allocations contains the core as a subset. A proof of this result normally involves an induction hypothesis to the number of players. We will give here a short proof based on a well known result in convex analysis.

Original language	English
Pages (from-to)	149-150
Number of pages	2
Journal	International Journal of Game Theory
Volume	21
DOIs	https://doi.org/10.1007/BF01245457
Publication status	Published - 1992

Access to Document

10.1007/BF01245457

Cite this

@article{37a213817da34dd6bf3373880c39807a,

title = "A Short Proof of the Inclusion of the Core in the Weber Set",

abstract = "For a transferable utility game the convex hull of the Weber allocations contains the core as a subset. A proof of this result normally involves an induction hypothesis to the number of players. We will give here a short proof based on a well known result in convex analysis.",

author = "J. Derks",

year = "1992",

doi = "10.1007/BF01245457",

language = "English",

volume = "21",

pages = "149--150",

journal = "International Journal of Game Theory",

issn = "0020-7276",

publisher = "Springer Verlag",

}

TY - JOUR

T1 - A Short Proof of the Inclusion of the Core in the Weber Set

AU - Derks, J.

PY - 1992

Y1 - 1992

N2 - For a transferable utility game the convex hull of the Weber allocations contains the core as a subset. A proof of this result normally involves an induction hypothesis to the number of players. We will give here a short proof based on a well known result in convex analysis.

AB - For a transferable utility game the convex hull of the Weber allocations contains the core as a subset. A proof of this result normally involves an induction hypothesis to the number of players. We will give here a short proof based on a well known result in convex analysis.

U2 - 10.1007/BF01245457

DO - 10.1007/BF01245457

M3 - Article

SN - 0020-7276

VL - 21

SP - 149

EP - 150

JO - International Journal of Game Theory

JF - International Journal of Game Theory

ER -

A Short Proof of the Inclusion of the Core in the Weber Set

Abstract

Access to Document

Fingerprint

Cite this