Related papers: On balanced capacities

The paper proposes a natural measure space of zero-sum perfect information games with upper semicontinuous payoffs. Each game is specified by the game tree, and by the assignment of the active player and of the capacity to each node of the…

In this paper we prove two new abstract compactness criteria in normed spaces. To this end we first introduce the notion of an equinormed set using a suitable family of semi-norms on the given normed space satisfying some natural…

In these notes, uniform convergence on compacta is studied on the space of functions taking values in the set of finite Borel measures. Related limit theorems, including L\'evy's continuity theorem and functional limit theorems for…

We information-theoretically reformulate two measures of capacity from statistical learning theory: empirical VC-entropy and empirical Rademacher complexity. We show these capacity measures count the number of hypotheses about a dataset…

In this paper we estimate the Kuratowski and the Hausdorff measures of noncompactness of bounded subsets of spaces of vector-valued bounded functions and of vector-valued bounded differentiable functions. To this end, we use a quantitative…

Fictitious play (FP) is one of the most fundamental game-theoretical learning frameworks for computing Nash equilibrium in $n$-player games, which builds the foundation for modern multi-agent learning algorithms. Although FP has provable…

We present a new method for computation of the index of completely mixed equilibria in finite games, based on the work of Eisenbud et al.(1977). We apply this method to solving two questions about the relation of the index of equilibria and…

Functional representations of the capacity monad based on the max and min operations were considered in \cite{Ra1} and \cite{Ny1}. Nykyforchyn considered in \cite{Ny2} some alternative monad structure for the possibility capacity functor…

Any nonempty, compact, semi-algebraic set in [0, 1] n is the projection of the set of mixed equilibria of a finite game with 2 actions per player on its first n coordinates. A similar result follows for sets of equilibrium payoffs. The…

In this paper we deal with a new approach to probabilistic reasoning in a logical framework. Nearly almost all logics of probability that have been proposed in the literature are based on classical two-valued logic. After making clear the…

This paper extends Berge's maximum theorem for possibly noncompact action sets and unbounded cost functions to minimax problems and studies applications of these extensions to two-player zero-sum games with possibly noncompact action sets…

Given a probability measure over a state space, a partial collection (sub-$\sigma$-algebra) of events whose probabilities are known, induces a capacity over the collection of all possible events. The \emph{induced capacity} of an event $F$…

This note reviews some physical aspects of the chaotic hypothesis in nonequilibrium statistical mechanics and attempts at the physical interpretation of the fluctuation theorem as a quantitative intermittency property

An economy, large or small, has traditionally been defined in terms of an explicit set of agents and an assignment of characteristics to each agent. But when individual agents are negligible, most economically relevant properties of an…

The core is a central solution concept in cooperative game theory, defined as the set of feasible allocations or payments such that no subset of agents has incentive to break away and form their own subgroup or coalition. However, it has…

Evaluating the channel capacity is one of many key problems in information theory. In this work we derive rather-mild sufficient conditions under which the capacity is finite and achievable. These conditions are derived for generic,…

We consider fair and consistent extensions of the Shapley value for games with externalities. Based on the restriction identified by Casajus et al. (2024, Games Econ. Behavior 147, 88-146), we define balanced contributions, Sobolev's…

We present generalization of the Bloom variety theorem of ordered algebras in fuzzy setting. We introduce algebras with fuzzy orders which consist of sets of functions which are compatible with particular binary fuzzy relations called fuzzy…

We show that any finite-entropy, countable-valued finitary factor of an i.i.d process can also be expressed as a finitary factor of a finite-valued i.i.d process whose entropy is arbitrarily close to the target process. As an application,…

We suggest to look at quantum measurement outcomes not through the lens of probability theory, but instead through decision theory. We introduce an original game-theoretical framework, model and algorithmic procedure where measurement…