Related papers: Minimax representation of nonexpansive functions a…
Many practical optimization problems lack strong convexity. Fortunately, recent studies have revealed that first-order algorithms also enjoy linear convergences under various weaker regularity conditions. While the relationship among…
We give a unified approach to handle the problem of extending functions with values in a locally convex Hausdorff space $E$ over a field $\mathbb{K}$, which have weak extensions in a space $\mathcal{F}(\Omega,\mathbb{K})$ of scalar-valued…
We prove that in a Riemannian manifold $M$, each function whose Hessian is proportional the metric tensor yields a weighted monotonicity theorem. Such function appears in the Euclidean space, the round sphere $S^n$ and the hyperbolic space…
A new representation is proposed for functions in a Sobolev space with dominating mixed smoothness on an $N$-dimensional hyperrectangle. In particular, it is shown that these functions can be expressed in terms of their highest-order mixed…
The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…
We derive two types of representation results for increasing convex functionals in terms of countably additive measures. The first is a max-representation of functionals defined on spaces of real-valued continuous functions and the second a…
We introduce a class of cooperative games induced by weighted directed graphs. Specifically, the coalitional value combines an internal interaction term given by the induced subgraph game with an external component based on minimal incoming…
In this work we consider $$ w_t=[(w_{hh}+c_0)^{-3}]_{hh},\qquad w(0)=w^0, $$ which is derived from a thin film equation for epitaxial growth on vicinal surface. We formulate the problem as the gradient flow of a suitably-defined convex…
We study the class of compact convex subsets of a topological vector space which admits a strictly convex and lower semicontinuous function. We prove that such a compact set is embeddable in a strictly convex dual Banach space endowed with…
The paper is concerned with two-person dynamic zero-sum games. We investigate the limit of value functions of finite horizon games with long run average cost as the time horizon tends to infinity, and the limit of value functions of…
Firmly nonexpansive mappings play an important role in metric fixed point theory and optimization due to their correspondence with maximal monotone operators. In this paper we do a thorough study of fixed point theory and the asymptotic…
For any object A in a simplicial model category M, we construct a topological space \^A which classifies homogeneous functors whose value on k open balls is equivalent to A. This extends a classification result of Weiss for homogeneous…
In this current work, we propose a Max Min approach for approximating functions using exponential neural network operators. We extend this framework to develop the Max Min Kantorovich-type exponential neural network operators and…
The existence of a homogeneous decomposition for continuous and epi-translation invariant valuations on super-coercive functions is established. Continuous and epi-translation invariant valuations that are epi-homogeneous of degree $n$ are…
We study the links between the values of stochastic games with varying stage duration $h$, the corresponding Shapley operators $\bf{T}$ and ${\bf{T}}\_h$and the solution of $\dot f\_t = ({\bf{T}} - Id )f\_t$. Considering general non…
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 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…
This paper presents new families of algorithms for the repeated play of two-agent (near) zero-sum games and two-agent zero-sum stochastic games. For example, the family includes fictitious play and its variants as members. Commonly, the…
We introduce a derivative-free global optimization algorithm that efficiently computes minima for various classes of one-dimensional functions, including non-convex, and non-smooth functions.This algorithm numerically approximates the…
In this paper, we delve into the utilization of the negative momentum technique in constrained minimax games. From an intuitive mechanical standpoint, we introduce a novel framework for momentum buffer updating, which extends the findings…