Related papers: On exact capacities
The set of all idempotent probability measures (Maslov measures) on a compact Hausdorff space endowed with the weak* topology determines is functorial on the category $\comp$ of compact Hausdorff spaces. We prove that the obtained functor…
We study the extent to which it is possible to approximate the optimal value of a Unique Games instance in Fixed-Point Logic with Counting (FPC). Formally, we prove lower bounds against the accuracy of FPC-interpretations that map Unique…
Understanding the convergence landscape of multi-agent learning is a fundamental problem of great practical relevance in many applications of artificial intelligence and machine learning. While it is known that learning dynamics converge to…
Observable games are game situations that reach one of possibly many Nash equilibria. Before an instance of the game starts, an external observer does not know, a priori, what is the exact profile of actions that will occur; thus, he…
Examples of games between two partners with mixed strategies, calculated by the use of the probability amplitude are given. The first game is described by the quantum formalism of spin one half system for which two noncommuting observables…
There are two definitions of the measurable functional on the topological vector space: as a linear and measurable real-valued function and as a pointwise limit of the sequence of the continious linear functionals. In general case they are…
We study the computational complexity of computing or approximating a quasi-proper equilibrium for a given finite extensive form game of perfect recall. We show that the task of computing a symbolic quasi-proper equilibrium is…
In this paper we introduce a metrics on the space of idempotent probability measures on a given compactum, which extends the metrics on the compactum. It is proven the introduced metrics generates the pointwise convergence topology on the…
For the functors acting in the category of compact Hausdorff spaces, we introduce the so-called open multi-commutativity property, which generalizes both bicommutativity and openness, and prove that this property is satisfied by the functor…
We study a model of selfish resource allocation that seeks to incorporate dependencies among resources as they exist in modern networked environments. Our model is inspired by utility functions with constant elasticity of substitution (CES)…
Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…
This paper proposes a new approach to power in Game Theory. Cooperation and conflict are simulated with a mechanism of payoff alteration, called F-game. Using convex combinations of preferences, an F-game can measure players' attitude to…
Suppose A is a finite set equipped with a probability measure P and let M be a ``mass'' function on A. We give a probabilistic characterization of the most efficient way in which A^n can be almost-covered using spheres of a fixed radius. An…
Flow games coincide precisely with the fundamental class of non-negative totally balanced games. However, the conditions for their convexity have remained elusive. In this paper, we resolve this challenge by providing a complete…
We introduce the compactness locus of a geometric functor between rigidly-compactly generated tensor-triangulated categories, and describe it for several examples arising in equivariant homotopy theory and algebraic geometry. It is a subset…
In this paper we first define a new kind of potential games, called coset weighted potential game, which is a generalized form of weighted potential game. Using semi-tensor product of matrices, an algebraic method is provided to verify…
In mechanism design, for a given type space, there may be incentive compatible outcome functions which are not affine maximizers. Using tools from linear algebra and tropical geometry, we prove that for two-player games on a discrete type…
The Unique Games Conjecture (UGC) constitutes a highly dynamic subarea within computational complexity theory, intricately linked to the outstanding P versus NP problem. Despite multiple insightful results in the past few years, a proof for…
We present a new variant of the potential game and show that certain compact subsets of $\R^n$, including a large class of self-affine sets, are winning in our game. We prove that sets with sufficiently strong winning conditions are…
Zero-sum and non-zero-sum (aka general-sum) games are relevant in a wide range of applications. While general non-zero-sum games are computationally hard, researchers focus on the special class of monotone games for gradient-based…