Related papers: Numerical Method for a Class of Algebraic Riccati …
This paper studies the solution existence of the continuous-time algebraic Riccati equation (CARE). We formulate the CARE as two constrained polynomial optimization problems, and then use Lasserre's hierarchy of semi-definite relaxations to…
In this paper, the problem of finding a Nash equilibrium of a multi-player game is considered. The players are only aware of their own cost functions as well as the action space of all players. We develop a relatively fast algorithm within…
In this paper, we introduce an iterative numerical method to solve systems of nonlinear equations. The third-order convergence of this method is analyzed. Several examples are given to illustrate the efficiency of the proposed method.
In this paper we consider a class of conjugate discrete-time Riccati equations, arising originally from the linear quadratic regulation problem for discrete-time antilinear systems. Under mild and reasonable assumptions, the existence of…
In earlier work we have studied a method for discretization in time of a parabolic problem which consists in representing the exact solution as an integral in the complex plane and then applying a quadrature formula to this integral. In…
The asymptotic iteration method (AIM) is an iterative technique used to find exact and approximate solutions to second-order linear differential equations. In this work, we employed AIM to solve systems of two first-order linear…
This paper introduces a generalization of the well-known Riccati recursion for solving the discrete-time equality-constrained linear quadratic optimal control problem. The recursion can be used to compute the solutions as well as optimal…
We have introduced the generalized alternating direction implicit iteration (GADI) method for solving large sparse complex symmetric linear systems and proved its convergence properties. Additionally, some numerical results have…
A novel integrability condition for the Riccati equation, the simplest form of nonlinear ordinary differential equations, is obtained by using elementary quadrature method. Under this condition, the analytic general solution is presented,…
We consider the application of implicit and linearly implicit (Rosenbrock-type) peer methods to matrix-valued ordinary differential equations. In particular the differential Riccati equation (DRE) is investigated. For the Rosenbrock-type…
In this study, the Riccati equation is resolved using the generalized recursive integrating factor method. By applying a non-linear transformation to the dependent variable $y(x)$ of the Riccati equation, a second-order linear differential…
This paper aims to develop a theory for linear-quadratic Nash systems and Master equations in possibly infinite-dimensional Hilbert spaces. As a first step and motivated by the recent results in [31], we study a more general model in the…
We study the structure of the set of equilibrium payoffs in finite games, both for Nash equilibrium and correlated equilibrium. A nonempty subset of R^2 is shown to be the set of Nash equilibrium payoffs of a bimatrix game if and only if it…
Several instances of integrable Riccati equations are analyzed from the geometric perspective of the theory of Lie systems. This provides us a unifying viewpoint for previous approaches.
Methods of exploring Nash equilibrium in quantum games are studied. Analytical conditions of the existence, the uniqueness or the multiplicity of the equilibria are found.
This paper is an exposition of algorithms for finding one or all equilibria of a bimatrix game (a two-player game in strategic form) in the style of a chapter in a graduate textbook. Using labeled "best-response polytopes", we present the…
In this paper, a large class of time-varying Riccati equations arising in stochastic dynamic games is considered. The problem of the existence and uniqueness of some globally defined solution, namely the bounded and stabilizing solution, is…
We study the problem of computing all Nash equilibria of a subclass of finite normal form games. With algebraic characterization of the games, we present a method for computing all its Nash equilibria. Further, we present a method for…
We present a polynomial-time algorithm that always finds an (approximate) Nash equilibrium for repeated two-player stochastic games. The algorithm exploits the folk theorem to derive a strategy profile that forms an equilibrium by…
A common strategy for solving an unconstrained two-player Nash equilibrium problem with continuous variables is applying Newton's method to the system of nonlinear equations obtained by the corresponding first-order necessary optimality…