Displaying similar documents to “A bi-average tree solution for probabilistic communication situations with fuzzy coalition”

Galvin Tree-Games

E. C. Milner (1985)

Publications du Département de mathématiques (Lyon)

Similarity:

Conway's Games and Some of their Basic Properties

Robin Nittka (2011)

Formalized Mathematics

Similarity:

We formulate a few basic concepts of J. H. Conway's theory of games based on his book [6]. This is a first step towards formalizing Conway's theory of numbers into Mizar, which is an approach to proving the existence of a FIELD (i.e., a proper class that satisfies the axioms of a real-closed field) that includes the reals and ordinals, thus providing a uniform, independent and simple approach to these two constructions that does not go via the rational numbers and hence does for example...

Alternative model of fuzzy NTU coalitional game

Milan Mareš, Milan Vlach (2003)

Kybernetika

Similarity:

One of the possible models of fuzzification of non-transferable utility (NTU) coalitional games was extensively treated in [4]. In this paper, we suggest an alternative structure of fuzzification of the NTU games, where for every coalition a fuzzy class of (generally crisp) sets of its admissible pay-off vectors is considered. It is shown that this model of a fuzzy coalitional game can be represented by a fuzzy class of deterministic NTU games, and its basic concepts like the superadditivity...

Hercules versus Hidden Hydra Helper

Jiří Matoušek, Martin Loebl (1991)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

L. Kirby and J. Paris introduced the Hercules and Hydra game on rooted trees as a natural example of an undecidable statement in Peano Arithmetic. One can show that Hercules has a “short” strategy (he wins in a primitively recursive number of moves) and also a “long” strategy (the finiteness of the game cannot be proved in Peano Arithmetic). We investigate the conflict of the “short” and “long” intentions (a problem suggested by J. Nešetřil). After each move of Hercules (trying to kill...

Club-guessing and non-structure of trees

Tapani Hyttinen (2001)

Fundamenta Mathematicae

Similarity:

We study the possibilities of constructing, in ZFC without any additional assumptions, strongly equivalent non-isomorphic trees of regular power. For example, we show that there are non-isomorphic trees of power ω₂ and of height ω · ω such that for all α < ω₁· ω · ω, E has a winning strategy in the Ehrenfeucht-Fraïssé game of length α. The main tool is the notion of a club-guessing sequence.

On the possibilities of fuzzification of the solution in fuzzy cooperative games.

Milan Mares (2002)

Mathware and Soft Computing

Similarity:

Some possibilities of fuzzification of the von Neumann-Morgenstern solution of cooperative games with transferable utility (TU games) are briefly investigated. The fuzzification based on the transformation of individual fuzzy TU game into a fuzzy class of (deterministic) TU games with their own specific solutions is discussed.

Additivities in fuzzy coalition games with side-payments

Milan Mareš (1999)

Kybernetika

Similarity:

The fuzzy coalition game theory brings a more realistic tools for the mathematical modelling of the negotiation process and its results. In this paper we limit our attention to the fuzzy extension of the simple model of coalition games with side-payments, and in the frame of this model we study one of the elementary concepts of the coalition game theory, namely its “additivities”, i. e., superadditivity, subadditivity and additivity in the strict sense. In the deterministic game theory...