Английская Википедия:Bondareva–Shapley theorem

Материал из Онлайн справочника
Версия от 20:03, 10 февраля 2024; EducationBot (обсуждение | вклад) (Новая страница: «{{Английская Википедия/Панель перехода}} The '''Bondareva–Shapley theorem''', in game theory, describes a necessary and sufficient condition for the non-emptiness of the core of a cooperative game in characteristic function form. Specifically, the game's core is non-empty if and only if the game is ''balanced''. The Bondareva–Shapley theorem implie...»)
(разн.) ← Предыдущая версия | Текущая версия (разн.) | Следующая версия → (разн.)
Перейти к навигацииПерейти к поиску

The Bondareva–Shapley theorem, in game theory, describes a necessary and sufficient condition for the non-emptiness of the core of a cooperative game in characteristic function form. Specifically, the game's core is non-empty if and only if the game is balanced. The Bondareva–Shapley theorem implies that market games and convex games have non-empty cores. The theorem was formulated independently by Olga Bondareva and Lloyd Shapley in the 1960s.

Theorem

Let the pair <math>\langle N, v\rangle</math> be a cooperative game in characteristic function form, where <math> N</math> is the set of players and where the value function <math> v: 2^N \to \mathbb{R} </math> is defined on <math>N</math>'s power set (the set of all subsets of <math>N</math>).

The core of <math>\langle N, v \rangle </math> is non-empty if and only if for every function <math>\alpha : 2^N \setminus \{\emptyset\} \to [0,1]</math> where

<math>\forall i \in N : \sum_{S \in 2^N : \; i \in S} \alpha (S) = 1</math>
the following condition holds:

<math>\sum_{S \in 2^N\setminus\{\emptyset\}} \alpha (S) v (S) \leq v (N).</math>

References