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

J. Derks*

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review


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 languageEnglish
Pages (from-to)149-150
Number of pages2
JournalInternational Journal of Game Theory
Publication statusPublished - 1992

Cite this