Displaying similar documents to “Cooperative fuzzy games extended from ordinary cooperative games with restrictions on coalitions”

Generalized Choquet spaces

Samuel Coskey, Philipp Schlicht (2016)

Fundamenta Mathematicae

Similarity:

We introduce an analog to the notion of Polish space for spaces of weight ≤ κ, where κ is an uncountable regular cardinal such that κ < κ = κ . Specifically, we consider spaces in which player II has a winning strategy in a variant of the strong Choquet game which runs for κ many rounds. After discussing the basic theory of these games and spaces, we prove that there is a surjectively universal such space and that there are exactly 2 κ many such spaces up to homeomorphism. We also establish a Kuratowski-like...

Two approaches to fuzzification of payments in NTU coalitional game.

Milan Mares (2002)

Mathware and Soft Computing

Similarity:

There exist several possibilities of fuzzification of a coalitional game. It is quite usual to fuzzify, e. g., the concept of coalition, as it was done in [1]. Another possibility is to fuzzify the expected pay-offs, see [3, 4]. The latter possibility is dealt even here. We suppose that the coalitional and individual pay-offs are expected only vaguely and this uncertainty on the input'' of the game rules is reflected also by an uncertainty of the derived output'' concept like superadditivity,...

On β-favorability of the strong Choquet game

László Zsilinszky (2011)

Colloquium Mathematicae

Similarity:

In the main result, partially answering a question of Telgársky, the following is proven: if X is a first countable R₀-space, then player β (i.e. the EMPTY player) has a winning strategy in the strong Choquet game on X if and only if X contains a nonempty W δ -subspace which is of the first category in itself.

Equilibrium analysis of distributed aggregative game with misinformation

Meng Yuan, Zhaoyang Cheng, Te Ma (2024)

Kybernetika

Similarity:

This paper considers a distributed aggregative game problem for a group of players with misinformation, where each player has a different perception of the game. Player’s deception behavior is inevitable in this situation for reducing its own cost. We utilize hypergame to model the above problems and adopt ϵ -Nash equilibrium for hypergame to investigate whether players believe in their own cognition. Additionally, we propose a distributed deceptive algorithm for a player implementing...

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...

Linear complementarity problems and bi-linear games

Gokulraj Sengodan, Chandrashekaran Arumugasamy (2020)

Applications of Mathematics

Similarity:

In this paper, we define bi-linear games as a generalization of the bimatrix games. In particular, we generalize concepts like the value and equilibrium of a bimatrix game to the general linear transformations defined on a finite dimensional space. For a special type of 𝐙 -transformation we observe relationship between the values of the linear and bi-linear games. Using this relationship, we prove some known classical results in the theory of linear complementarity problems for this type...

Existence of the value of fixed duration dynamical games

Piotr Borówko, Witold Rzymowski

Similarity:

CONTENTS1. Introduction.......................................................................................................52. Game................................................................................................................63. Approximation condition....................................................................................84. Differential games of Friedman’s type.............................................................13  4.1. Game without delay....................................................................................13  4.2....

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.

Open topics in fuzzy coalitional games with transferable utility

Milan Mareš (2006)

Banach Center Publications

Similarity:

Vagueness is one of the phenomena which cannot be separated from the real bargaining and cooperative situations. The aim of this paper is to offer a brief survey of the recent state-of-art of the modelling of vagueness in coalitional games with transferable utility. It may be recognized in two components of these games, namely, in vague structure of coalitions where each player may simultaneously participate in several of them, and in vague expectations of coalitional pay-offs. Both...

Applications of limited information strategies in Menger's game

Steven Clontz (2017)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

As shown by Telgársky and Scheepers, winning strategies in the Menger game characterize σ -compactness amongst metrizable spaces. This is improved by showing that winning Markov strategies in the Menger game characterize σ -compactness amongst regular spaces, and that winning strategies may be improved to winning Markov strategies in second-countable spaces. An investigation of 2-Markov strategies introduces a new topological property between σ -compact and Menger spaces.

Bayesian Nash equilibrium seeking for multi-agent incomplete-information aggregative games

Hanzheng Zhang, Huashu Qin, Guanpu Chen (2023)

Kybernetika

Similarity:

In this paper, we consider a distributed Bayesian Nash equilibrium (BNE) seeking problem in incomplete-information aggregative games, which is a generalization of either Bayesian games or deterministic aggregative games. We handle the aggregation function to adapt to incomplete-information situations. Since the feasible strategies are infinite-dimensional functions and lie in a non-compact set, the continuity of types brings barriers to seeking equilibria. To this end, we discretize...