Related papers: On exact capacities
In the work it is shown that the space of idempotent probability measures with compact supports is kappa-metrizable if the given Tychonoff space is kappa-metrizable. It is constructed a series of max-plus-convex subfunctors of the functor…
With a simple generic approach, we develop a classification that encodes and measures the strength of completeness (or compactness) properties in various types of spaces and ordered structures. The approach also allows us to encode notions…
We study equilibrium concepts in non-cooperative games under uncertainty where both beliefs and mixed strategies are represented by non-additive measures (capacities). In contrast to the classical Nash framework based on additive…
The class of totally balanced games is a class of transferable-utility coalitional games providing important models of cooperative behavior used in mathematical economics. They coincide with market games of Shapley and Shubik and every…
Let S be a topological property of sequences (such as, for example, "to contain a convergent subsequence" or "to have an accumulation point"). We introduce the following open-point game OP(X,S) on a topological space X. In the n'th move,…
The class of algorithmically computable simple games (i) includes the class of games that have finite carriers and (ii) is included in the class of games that have finite winning coalitions. This paper characterizes computable games,…
Idempotent analogues of convexity are introduced. It is proved that the category of algebras for the capacity monad in the category of compacta is isomorphic to the category of $(\max,\min)$-idempotent biconvex compacta and their biaffine…
We introduce the notions of weakly *-concave and weakly naturally quasi-concave correspondence and prove fixed point theorems and continuous selection theorems for these kind of correspondences. As applications in the game theory, by using…
In this paper we establish that the functor of idempotent probability measures acting in the category of compacta and their continous mappings is perfect metrisable
We can define a module to be an exact functor on a small abelian category. This is explained and shown to be equivalent to the usual definition but it does offer a different perspective, inspired by the notions from model theory of…
In his influential work Choquet systematically studied capacities on Boolean algebras in a topological space, and gave a probabilistic interpretation for completely monotone (and completely alternating) capacities. Beyond complete…
We provide a characterization in terms of Fatou closedness for weakly closed monotone convex sets in the space of $\mathcal{P}$-quasisure bounded random variables, where $\mathcal{P}$ is a (possibly non-dominated) class of probability…
The category of open games, which provides a strongly compositional foundation of economic game theory, is intermediate between symmetric monoidal and compact closed. More precisely it has counits with no corresponding units, and a…
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…
We study strong equilibria in symmetric capacitated cost-sharing games. In these games, a graph with designated source $s$ and sink $t$ is given, and each edge is associated with some cost. Each agent chooses strategically an $s$-$t$ path,…
We provide a unifying, black-box tool for establishing existence of approximate equilibria in weighted congestion games and, at the same time, bounding their Price of Stability. Our framework can handle resources with general…
Pursuing a new approach to the study of infinite games in combinatorics, we introduce the categories $\mathbf{Game}_{A}$ and $\mathbf{Game}_{B}$ and improve some classical results concerning topological games related to the duality between…
A robust game is a distribution-free model to handle ambiguity generated by a bounded set of possible realizations of the values of players' payoff functions. The players are worst-case optimizers and a solution, called robust-optimization…
Covering spaces of graphs have long been useful for studying expanders (as "graph lifts") and unique games (as the "label-extended graph"). In this paper we advocate for the thesis that there is a much deeper relationship between…
We study potential games on unimodular random graphs of bounded degree, where players interact through the underlying network. Using the unimodular measure, we define a well-posed global potential that captures both finite- and…