Search

In a joint enterprise, multi person decision-making and distribution of proceeds of cooperation among the participants is modeled using an assignment optimization problem. Cyclic permutation games are used for computing such n-player models.

Polynomial bounded algorithm is used to calculate the nucleolus of neighbor games.

A study was conducted to characterize an algorithm that determines the nucleolus of a general n-person balanced connected game. The input is represented by the array of the explicitly given values of the n(n+1)/2 connected coalitions. The algorithm produces a sequence of at most n(n-1)/2 payoff vectors from a unique vertex of the nonempty core and ending in the nucleolus. Moreover, recursive formulas were used to determine payoff vectors.