predecessor

Given a permutation 0 of players and a player i, calculate the
set of predecessors of the player i in the order 0

The main objective of cooperative games is to allocate a good among
the agents involved. This package includes the most well-known   allocation
rules, i.e., the Shapley value, the Banzhaf value, the egalitarian rule, and
the equal surplus division value. In addition, it considers the point of view
of a priori unions (situations in which agents can form coalitions). For this
purpose, the package includes the Owen value, the Banzhaf-Owen value, and the
corresponding extensions of the egalitarian rules. All these values can be
calculated exactly or estimated by sampling.

Maria D. Guillen

TUvalues

Tools for Calculating Allocations in Game Theory using Exact and
Approximated Methods

Juan Carlos Gonçalves

predecessor function

<dl><dt>permutation</dt>
<dd>A permutation of the players</dd>
<dt>player</dt>
<dd>Number of the player i</dd>
<dt>include_player</dt>
<dd>Whether the player i is included as predecessor of
itself or not</dd></dl>

Arguments

Predecessor — predecessor

<dl>

<dt>permutation</dt>
<dd>A permutation of the players</dd>


<dt>player</dt>
<dd>Number of the player i</dd>


<dt>include_player</dt>
<dd>Whether the player i is included as predecessor of
itself or not</dd>

</dl>

predecessor: Predecessor

Description

Usage

Value

Arguments