Related papers: Weak covering properties and infinite games

We present a new variation of the classical selection principles $\mathsf{S}_\mathrm{k}(\mathcal A, \mathcal B)$ ($k\in\mathbb N$) and $\mathsf{S}_\mathrm{fin}(\mathcal A, \mathcal B)$ that formally lies between these two properties. As in…

For a countable, weakly minimal theory, we show that the Schroeder-Bernstein property (any two elementarily bi-embeddable models are isomorphic) is equivalent to both a condition on orbits of rank 1 types and the property that the theory…

We extend Berge's Maximum Theorem to allow for incomplete preferences. We first provide a simple version of the Maximum Theorem for convex feasible sets and a fixed preference. Then, we show that if, in addition to the traditional…

We give a survey on the theory of representation-finite and certain minimal representation-infinite algebras.The main goals are the existence of multiplicative bases and of coverings with good properties. Both are attained via…

This paper is a twofold contribution. First, it contributes to the problem of enumerating some classes of simple games and in particular provides the number of weighted games with minimum and the number of weighted games for the dual class…

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…

When applied to the same game, probability theory and game theory can disagree on calculated values of the Fisher information, the log likelihood function, entropy gradients, the rank and Jacobian of variable transforms, and even the…

Quite recently, a new property related to norm-attaining operators has been introduced: the weak maximizing property (WMP). In this note, we define a generalised version of it considering other topologies than the weak one (mainly the…

We consider a natural way of extending the Lebesgue covering dimension to various classes of infinite dimensional separable metric spaces.

This paper has two central aims: first, to provide simple conditions under which the generalized games in choice form and, consequently, the abstract economies, admit equilibrium; second, to study the solvability of several types of systems…

A large body of research is currently investigating on the connection between machine learning and game theory. In this work, game theory notions are injected into a preference learning framework. Specifically, a preference learning problem…

We consider time-dependent viscous Mean-Field Games systems in the case of local, decreasing and unbounded coupling. These systems arise in mean-field game theory, and describe Nash equilibria of games with a large number of agents aiming…

Selection of input features such as relevant pieces of text has become a common technique of highlighting how complex neural predictors operate. The selection can be optimized post-hoc for trained models or incorporated directly into the…

Game theory provides a general mathematical background to study the effect of pair interactions and evolutionary rules on the macroscopic behavior of multi-player games where players with a finite number of strategies may represent a wide…

Recently Feinberg et al. [arXiv:1609.03990] established results on continuity properties of minimax values and solution sets for a function of two variables depending on a parameter. Such minimax problems appear in games with perfect…

Admissibility has been studied for games of infinite duration with Boolean objectives. We extend here this study to games of infinite duration with quantitative objectives. First, we show that, un- der the assumption that optimal worst-case…

In this thesis we introduce quantum refereed games, which are quantum interactive proof systems with two competing provers. We focus on a restriction of this model that we call "short quantum games" and we prove an upper bound and a lower…

In this expository article, we give an overview of the concept of potential mean field games of first order. We give a new proof that minimizers of the potential are equilibria by using a Lagrangian formulation. We also provide criteria to…

An algorithm is proposed to verify whether a finite game is a weighted potential game (WPG) without pre-knowledge on its weights. Then the algorithm is also applied to find the closest WPG for a given finite game. The concept and criterion…

We propose an original model for inferring team strengths using a Markov Random Field, which can be used to generate historical estimates of the offensive and defensive strengths of a team over time. This model was designed to be applied to…