On exact and totally bounded capacities
Анотація
We consider capacity (fuzzy measure, non-additive probability) on a compactum as a monotone cooperative normed game. We introduce topological analogues of well known class of exact games and show that these classes form subfunctors of the capacity functor which lie between known subfunctors of convex capacities and balanced capacities. It is natural to consider probability measures as elements of core of such games. We describe exact capacities as envelopes of the convex closed sets of probability measures. Using such representation we prove openness of the functor of exact capacities. We also consider strongly exact capacities and pose the problem of coincidence of these two classes.
Класифікація
Рецензії (0)
Написати рецензіюРецензій ще немає. Будьте першим!
Схожі роботи
On (non-) monotonicity of cooperative solutions
Схоже за: Game Theory and Voting Systems · Game Theory and Applications · Economic theories and models
Games with Linear Conjectures About System Parameters
Схоже за: Game Theory and Voting Systems · Game Theory and Applications · Economic theories and models
Solutions for zero‐sum two‐player games with noncompact decision sets and unbounded payoffs
Схоже за: Game Theory and Voting Systems · Game Theory and Applications · Economic theories and models
On Equilibrium Existence in Payoff Secure Games
Схоже за: Game Theory and Voting Systems · Game Theory and Applications · Economic theories and models
On (Non-) Monotonicity of Cooperative Solutions
Схоже за: Game Theory and Voting Systems · Game Theory and Applications · Economic theories and models
An asymmetric Cournot-Nash equilibrium under uncertainty as a generalized Cournot-Stackelberg-Nash equilibrium
Схоже за: Game Theory and Voting Systems · Economic theories and models