On the computation of probabilistic coalition structures

Given a coalition T (not necessarily admissible) a selection of S is strategy-proof for each player in T if and only if each one reaches his incremental value at any

Avec la réunification, un nouveau parti a émergé sur la scène politique, le PDS, héritier des anciens communistes devenu Die Linke (La Gauche, ou, plus justement, la gauche de

However, the general approaches discussed here – the use of a hybrid linear–nonparametric regression algorithm, the examination of calibrations by limiting the environmental

The cellular homology of a n-dimensional chain of surfaces computed with the above defined cellular boundary operator is equivalent to the simplicial ho- mology of the

The paper proposes a list of requirements for a game able to describe individually motivated social interactions: be non-cooperative, able to construct multiple coalitions in

Now, we will prove that the vector subspace of games inseparable from the null game by modified semivalues is spanned by games introduced here under the name of expanded shuffle

coalition structure construction as a non-cooperative game along with an equilibrium concept for this game, (this paper).. equilibrium concept for the family of games,

In this paper, along the line of Tomiyama (1987) and Diffo Lambo and Moulen (2002), we conduct an ordinal comparison of the desirability relation with the preorderings induced in the