zbMATH — the first resource for mathematics

Alternative model of fuzzy NTU coalitional game. (English) Zbl 1249.91009
Summary: One of the possible models of fuzzification of non-transferable utility (NTU) coalitional games was extensively treated in [the first author, Fuzzy cooperative games. Cooperation with vague expectations. Heidelberg: Physica-Verlag (2001; Zbl 1005.91013)]. In this paper, we suggest an alternative structure of fuzzification of 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 superadditivity or core can be transparently introduced by means of that class of games.
91A12 Cooperative games
03E72 Theory of fuzzy sets, etc.
Full Text: Link EuDML
[1] Luce R. D., Raiffa H.: Games and Decisions. Wiley, London - New York 1957 · Zbl 1233.91002
[2] Mareš M.: General coalition games. Kybernetika 14 (1978), 4, 245-260 · Zbl 0387.90116
[3] Mareš M.: Superadditivity in general fuzzy coalition games. Kybernetika 36 (2000), 3, 265-277 · Zbl 1249.91008 · www.kybernetika.cz · eudml:33483
[4] Mareš M.: Fuzzy Cooperative Games. Cooperation with Vague Expectations. Physica-Verlag, Heidelberg 2002 · Zbl 1037.91007 · eudml:39238
[5] Mareš M., Vlach M.: Concept of linear coalition game. Tatra Mountains Math. Publications · Zbl 1154.91323
[6] Mareš M., Vlach M.: Linear coalitional games and their fuzzy extensions. Internat. J. Uncertainty, Fuzziness and Knowledge-Based Systems · Zbl 1113.91303 · doi:10.1142/S021848850100082X
[7] Rosenmüller J.: The Theory of Games and Markets. North-Holland, Amsterdam 1982 · Zbl 0464.90089
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.