Random reduction consistency of the Weber set, the core and the anti-core

Yasushi Agatsuma, Yukihiko Funaki, Koji Yokote

Research output: Contribution to journalArticle

Abstract

In this paper we introduce a new consistency condition and provide characterizations for several solution concepts in TU cooperative game theory. Our new consistency condition, which we call the random reduction consistency, requires the consistency of payoff vectors assigned by a solution concept when one of the players is removed with some probability. We show that the random reduction consistency and other standard properties characterize the Weber set, the convex hull of the marginal contribution vectors. Another salient feature of random reduction consistency is that, by slightly changing its definition, we can characterize the core and the anti-core in a parallel manner. Our result enables us to compare the difference between the three solution concepts from the viewpoint of consistency.

Original languageEnglish
Pages (from-to)389-405
Number of pages17
JournalMathematical Methods of Operations Research
Volume85
Issue number3
DOIs
Publication statusPublished - 2017 Jun 1

Keywords

  • Anti-core
  • Consistency
  • Core
  • Game theory
  • TU game
  • Weber set

ASJC Scopus subject areas

  • Software
  • Mathematics(all)
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'Random reduction consistency of the Weber set, the core and the anti-core'. Together they form a unique fingerprint.

  • Cite this