`CooperativeGames.GraphGame`

— TypeA graph game extends a simple game with a list of edges,

L = [(i, j), (j, k), …]

`CooperativeGames.fᵦⁱ`

— MethodBanzhaf (1965) value

`CooperativeGames.fₛ`

— MethodShapey value using permutations

`CooperativeGames.fₛⁱ`

— MethodShapey value using Harsanyi dividends

`CooperativeGames.graphtoMyerson`

— MethodConvert a graph game to a simple game based on Myerson (1977). Namely, assume v(S) > 0 iff S is connected subgraph.

`CooperativeGames.isconvex`

— MethodBreadth first test of convexity of a game,

For all S, T ∈ P(G): v(S ∪ T) + v(S ∩ T) ≥ v(S) + v(T)

`CooperativeGames.isincore`

— MethodCheck if a solution x is in the core of G. Namely,

```
- ∑ x < v(N)
- ∑ₛ x < v(S) ∀ S
```

`CooperativeGames.valuemapping`

— MethodMaps v to every possible coalition P(G)

`CooperativeGames.Δₕ`

— MethodHarsanyi dividends for S ⊂ N

`CooperativeGames.μ`

— MethodMyerson solution, it is equivalent to the Shapley value of the Myerson game.