We characterize intrinsic Lipschitz functions as maps which can be approximated by a sequence of smooth maps, with pointwise convergent intrinsic gradient. We also provide an estimate of the Lipschitz constant of an intrinsic Lipschitz function in terms of the L∞−norm of its intrinsic gradient.

The Lipschitz constant of a finite normal–form game is the maximal change in some player's payoff when a single opponent changes his strategy. We prove that games with small Lipschitz constant admit pure ǫ-equilibria, and pinpoint the maximal Lipschitz constant that is sufficient to imply existence of pure ǫ-equilibrium as a function of the number of players in the game and the number of strate...

In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...

We investigate contextual online learning with nonparametric (Lipschitz) comparison classes under different assumptions on losses and feedback information. For full information feedback and Lipschitz losses, we design the first explicit algorithm achieving the minimax regret rate (up to log factors). In a partial feedback model motivated by second-price auctions, we obtain algorithms for Lipsch...

We show that in two dimensions or higher, the Mordukhovich-loffe approximate subdifferential and Clarke subdifferential may differ almost everywhere for real-valued Lipschitz functions. Uncountably many Frechet differentiable vector-valued Lipschitz functions differing by more than constants can share the same Mordukhovich-Ioffe coderivatives. Moreover, the approximate Jacobian associated with ...

We consider a pair of reflected Brownian motions in a Lipschitz planar domain starting from different points but driven by the same Brownian motion. First we construct such a pair of processes in a certain weak sense, since it is not known whether a strong solution to the Skorohod equation in Lipschitz domains exists. Then we prove that the distance between the two processes converges to zero w...

In this note we show that reconstruction from magnitudes of frame coefficients (the so called “phase retrieval problem”) can be performed using Lipschitz continuous maps. Specifically we show that when the nonlinear analysis map α : H → Rm is injective, with (α(x))k = |〈x, fk〉|, where {f1, · · · , fm} is a frame for the Hilbert space H, then there exists a left inverse map ω : Rm → H that is Li...

2.1 Definition: Lipschitz Function A real valued function f : D ⊆ R → R is called Lipschitz continuous or is said to satisfy a Lipschitz condition if there exists a constant K ≥ 0 such that for all x1, x2 in D |f(x1)− f(x2)| ≤ K|x1 − x2| (3) The inequality is (trivially) satisfied if x1 = x2. Otherwise, for x1 6= x2, one can equivalently define a function to be Lipschitz if and only if |f(x1)−f...

Inspired by an open problem of Alsina, Frank and Schweizer, k-Lipschitz t-norms are studied. The k-convexity of continuous monotone functions is introduced. Additive generators of k-Lipschitz tnorms are completely characterized by means of k-convexity. For a given k ∈ [1,∞[ the pointwise infimum A∗k of the class of all k-Lipschitz t-norms is introduced.