Related papers: The matrix potential game and structures of self-a…
Hindman's celebrated Finite Sums Theorem, and its high-dimensional version due to Milliken and Taylor, are extended from covers of countable sets to covers of arbitrary topological spaces with Menger's classic covering property. The methods…
We prove that the set of bounded geodesics in Teichmuller space are a winning set for Schmidt's game. This is a notion of largeness in a metric space that can apply to measure 0 and meager sets. We prove analogous closely related results on…
The boundedness tests for the number of compact integral manifolds of autonomous ordinary differential systems, of autonomous total differential systems, of linear systems of partial differential equations, of Pfaff systems of equations,…
We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…
Since the 1970s there has been a rich theory of equilibrium states over shift spaces associated to H\"older-continuous real-valued potentials. The construction of equilibrium states associated to matrix-valued potentials is much more…
A reconstruction problem is formulated for multisets over commutative groupoids. The cards of a multiset are obtained by replacing a pair of its elements by their sum. Necessary and sufficient conditions for the reconstructibility of…
We show that in algebraically locally finite countable homogeneous structures with a free stationary independence relation the small index property implies the strong small index property. We use this and the main result of [15] to deduce…
We propose a new determinacy hypothesis for transfinite games, use the hypothesis to extend the perfect set theorem, prove relationships between various determinacy hypotheses, expose inconsistent versions of determinacy, and provide a…
A new solution concept for two-player zero-sum matrix games with multi-dimensional payoff is introduced. It is based on extensions of vector orders in K-dimensional spaces to order relations in their power sets, so-called set relations, and…
A new method of analysing positive bistochastic maps on the algebra of complex matrices $M_{3}$ has been proposed. By identifying the set of such maps with a convex set of linear operators on $\mathbb{R}^{8}$, one can employ techniques from…
In this paper we provide sufficient conditions that ensure the existence of the solution of some vector equilibrium problems in Hausdorff topological vector spaces ordered by a cone. The conditions that we consider are imposed not on the…
We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…
We study uncoordinated matching markets with additional local constraints that capture, e.g., restricted information, visibility, or externalities in markets. Each agent is a node in a fixed matching network and strives to be matched to…
We consider a class of coalition formation games called hedonic games, i.e., games in which the utility of a player is completely determined by the coalition that the player belongs to. We first define the class of subset-additive hedonic…
Parsimonious games are a subset of constant sum homogeneous weighted majority games unequivocally described by their free type representation vector. We show that the minimal winning quota of parsimonious games satisfies a second order,…
We study nonzero-sum hypothesis testing games that arise in the context of adversarial classification, in both the Bayesian as well as the Neyman-Pearson frameworks. We first show that these games admit mixed strategy Nash equilibria, and…
A poset game is a two-player game played over a partially ordered set (poset) in which the players alternate choosing an element of the poset, removing it and all elements greater than it. The first player unable to select an element of the…
Adversarial training, a special case of multi-objective optimization, is an increasingly prevalent machine learning technique: some of its most notable applications include GAN-based generative modeling and self-play techniques in…
We consider extensive games with perfect information with well-founded game trees and study the problems of existence and of characterization of the sets of subgame perfect equilibria in these games. We also provide such characterizations…
Noticing the similarity between the monotone weak distributive laws combining two layers of nondeterminism in sets and in compact Hausdorff spaces, we study whether the latter law can be obtained automatically as a weak lifting of the…