Related papers: Local Nash Realizations
Inspired by some recent development on the theory about projection valued dilations for operator valued measures or more generally bounded homomorphism dilations for bounded linear maps on Banach algebras, we explore a pure algebraic…
This paper shows the affirmative answer to the local Nash problem for a toric singularity and analytically pretoric singularity. As a corollary we obtain the affirmative answer to the local Nash problem for a quasi-ordinary singularity.
This paper investigates the convergence time of log-linear learning to an $\epsilon$-efficient Nash equilibrium in potential games, where an efficient Nash equilibrium is defined as the maximizer of the potential function. Previous…
In this paper we present new proofs using real spectra of the finiteness theorem on Nash trivial simultaneous resolution and the finiteness theorem on Blow-Nash triviality for isolated real algebraic singularities. That is, we prove that a…
Zero-sum games arise in a wide variety of problems, including robust optimization and adversarial learning. However, algorithms deployed for finding a local Nash equilibrium in these games often converge to non-Nash stationary points. This…
Neural Networks (NNs) can provide major empirical performance improvements for robotic systems, but they also introduce challenges in formally analyzing those systems' safety properties. In particular, this work focuses on estimating the…
In the first part of this paper we introduced an algorithm that uses reachable set approximation to approximate the minimum time function of linear control problems. To illustrate the error estimates and to demonstrate differences to other…
Nash Q-learning may be considered one of the first and most known algorithms in multi-agent reinforcement learning (MARL) for learning policies that constitute a Nash equilibrium of an underlying general-sum Markov game. Its original proof…
Nash equilibrium is one of the most influential solution concepts in game theory. With the development of computer science and artificial intelligence, there is an increasing demand on Nash equilibrium computation, especially for Internet…
In this paper, we first provide a simple variational proof of the existence of Nash equilibrium in Hilbert spaces by using optimality conditions in convex minimization and Schauder's fixed-point theorem. Then applications of convex analysis…
In this paper we study the existence and uniqueness of Nash equilibria (solution to competition-wise problems, with several controls trying to reach possibly different goals) associated to linear partial differential equations and show…
This paper seeks to prove the bijectivity of the "Nash mapping" from the set of irreducible components of the scheme parametrizing analytic arcs on an algebraic surface $X$ whose origin is a singular point, into the set of irreducible…
In Banach space theory, the ``local theory'' refers to the collection of finite dimensional methods and ideas which are used to study infinite dimensional spaces (see e.g. [P4,TJ]). It is natural to try to develop an analogous theory in the…
Building upon the results in [Hinterm\"uller et al., SIAM J. Optim, '15], generalized Nash equilibrium problems are considered, in which the feasible set of each player is influenced by the decisions of their competitors. This is realized…
In this paper, we study small-time local controllability of real analytic control-affine systems under small perturbations of their vector fields. Consider a real analytic control system $\mathcal{X}$ which is small-time locally…
The h-cobordism theorem is a noted theorem in differential and PL topology. A generalization of the h-cobordism theorem for possibly non simply connected manifolds is the so called s-cobordism theorem. In this paper, we prove semialgebraic…
Let {X_n} be a sequence of analytic sets converging to some analytic set X in the sense of holomorphic chains. We introduce a condition which implies that every irreducible component of X is the limit of a sequence of irreducible components…
New sensitivity-based methods are developed for determining identifiability and observability of nonsmooth input-output systems. More specifically, lexicographic calculus is used to construct nonsmooth sensitivity rank condition (SERC)…
Examining the behavior of multi-agent systems is vitally important to many emerging distributed applications - game theory has emerged as a powerful tool set in which to do so. The main approach of game-theoretic techniques is to model…
We present a method that connects a well-established nonlinear (bilinear) identification method from time-domain data with neural network (NNs) advantages. The main challenge for fitting bilinear systems is the accurate recovery of the…