نتایج جستجو برای: minimax inequality
تعداد نتایج: 64047 فیلتر نتایج به سال:
The partial KKM principle for an abstract convex space is an abstract form of the classical KKM theorem. In this paper, we derive generalized forms of the Ky Fan minimax inequality, the von Neumann-Sion minimax theorem, the von Neumann-Fan intersection theorem, the Fan-type analytic alternative, and the Nash equilibrium theorem for abstract convex spaces satisfying the partial KKM principle. Th...
This paper provides necessary and sufficient conditions for fixed-point theorems, minimax inequalities and some related theorems defined on arbitrary topological spaces that may be discrete, continuum, non-compact or non-convex. We establish a single condition, γ-recursive transfer lower semicontinuity, which fully characterizes the existence of equilibrium of minimax inequality without imposin...
i=1 pi log 1 pi . To do this, we must bound the two terms on the right hand side of the bound above. Step 1: Bounding the Range of the Regularizer We begin by deriving upper and lower bounds on the entropy function H(~ p). The lower bound is easy. Since for all i, 0 ≤ pi ≤ 1 , pi log 1 p i ≥ 0. (Remember that we define 0 log(1/0) to be 0 by convention.) As we discussed before, H(~ p) = 0 is ach...
This note uses a simple example to show how moment inequality models used in the empirical economics literature lead to general minimax relative efficiency comparisons. The main point is that such models involve inference on a low dimensional parameter, which leads naturally to a definition of “distance” that, in full generality, would be arbitrary in minimax testing problems. This definition o...
In this paper, we give a new minimax theorem and two new existence theorems of solutions for generalized quasi–variational inequalities in H-spaces. Our results improve and develop some famous results.
In this paper, a new objective penalty function approach is proposed for solving minimax programming problems with equality and inequality constraints. This new objective penalty function combines the objective penalty and constraint penalty. By the new objective penalty function, a constrained minimax problem is converted to minimizations of a sequence of continuously differentiable functions ...
This note uses a simple example to show how moment inequality models used in the empirical economics literature lead to general minimax relative efficiency comparisons. The main point is that such models involve inference on a low dimensional parameter, which leads naturally to a definition of “distance” that, in full generality, would be arbitrary in minimax testing problems. This definition o...
A precise description of the convexity of Gaussian measures is provided by sharp Brunn-Minkowski type inequalities due to Ehrhard and Borell. We show that these are manifestations of a game-theoretic mechanism: a minimax variational principle for Brownian motion. As an application, we obtain a Gaussian improvement of Barthe’s reverse Brascamp-Lieb inequality.
In this paper, we consider and study a class of vector variational-like inequalities in Banach space without any generalized monotonicity by exploiting vector version of minimax inequality and obtain the existence results of solutions to the class of vector variational-like inequalities. The results presented here are different from [1, 5, 11], and extend and generalize the corresponding result...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید