相关论文: An example showing that A-lower semi-continuity is…

Over the last two decades, submodular function maximization has been the workhorse of many discrete optimization problems in machine learning applications. Traditionally, the study of submodular functions was based on binary function…

Dependence on the parameter is continuous when perturbations of the parameter preserves strict preference for one alternative over another. We characterise this property via a utility function over alternatives that depends continuously on…

In this paper, we present a new extension of the famous Serrin's lower semicontinuity theorem for the variational functional $\int_{\Omega}f(x,u,u')dx$,we prove its lower semicontinuity in $W_{loc}^{1,1}(\Omega)$ with respect to the strong…

There are two basic ways of weakening the definition of the well-known metric regularity property by fixing one of the points involved in the definition. The first resulting property is called metric subregularity and has attracted a lot of…

We give an example of a convex, finite and lower semicontinuous function whose subdifferential is everywhere empty. This is possible since the function is defined on an incomplete normed space. The function serves as a universal…

Several results concerning existence of solutions of a quasiequilibrium problem defined on a finite dimensional space are established. The proof of the first result is based on a Michael selection theorem for lower semicontinuous set-valued…

In this paper, we prove the following Theorems 1. An extremally disconnected space $X$ has the semi-Menger property if and only if One does not have a winning strategy in the game $G_{fin}(sO,sO)$. 2. An extremally disconnected space $X$…

We study the performance of Fictitious Play, when used as a heuristic for finding an approximate Nash equilibrium of a 2-player game. We exhibit a class of 2-player games having payoffs in the range [0,1] that show that Fictitious Play…

The minimax theorem for zero-sum games is easily proved from the strong duality theorem of linear programming. For the converse direction, the standard proof by Dantzig (1951) is known to be incomplete. We explain and combine classical…

We analyze the performance of alternating minimization for loss functions optimized over two variables, where each variable may be restricted to lie in some potentially nonconvex constraint set. This type of setting arises naturally in…

We consider isotropic non lower semicontinuous weighted perimeter functionals defined on partitions of domains in $\mathbb{R}^n$. Besides identifying a condition on the structure of the domain which ensures the existence of minimizing…

We propose a novel algorithm for the solution of mean-payoff games that merges together two seemingly unrelated concepts introduced in the context of parity games, small progress measures and quasi dominions. We show that the integration of…

For a dynamical system on n-dimensional projective space over a number field or a function field, we show that semi-stable reduction implies the minimality of the resultant. We use this to show that every such dynamical system over a number…

The discovery that the minimax decision rule performs poorly in some games has sparked interest in possible alternatives to minimax. Until recently, the only games in which minimax was known to perform poorly were games which were mainly of…

The weak lower semicontinuity of the functional $$ F(u)=\int_{\Omega}f(x,u,\nabla u)\, dx$$ is a classical topic that was studied thoroughly. It was shown that if the function $f$ is continuous and convex in the last variable, the…

In Stackelberg v/s Stackelberg games a collection of leaders compete in a Nash game constrained by the equilibrium conditions of another Nash game amongst the followers. The resulting equilibrium problems are plagued by the nonuniqueness of…

Minimization is a reoccurring theme in many mathematical disciplines ranging from pure to applied ones. Of particular importance is the minimization of integral functionals that is studied within the calculus of variations. Proofs of the…

Consider concurrent, infinite duration, two-player win/lose games played on graphs. If the winning condition satisfies some simple requirement, the existence of Player 1 winning (finite-memory) strategies is equivalent to the existence of…

A multi-variable adaptive controller is derived as the explicit solution to a minimax dynamic game. The minimizing player selects the control action as a function of past state measurements and inputs. The maximizing player selects…

We consider the relation between Sion's minimax theorem for a continuous function and a Nash equilibrium in a multi-players game with two groups which is zero-sum and symmetric in each group. We will show the following results. 1. The…