Computing all solutions of Nash equilibrium problems with discrete strategy sets

The Nash equilibrium problem is a widely used tool to model non-cooperative games. Many solution methods have been proposed in the literature to compute solutions of Nash equilibrium problems with continuous strategy sets, but, besides some specific methods for some particular applications, there are no general algorithms to compute solutions of Nash equilibrium problems in which the strategy set of each player is assumed to be discrete. We define a branching method to compute the whole solution set of Nash equilibrium problems with discrete strategy sets. This method is equipped with a procedure that, by fixing variables, effectively prunes the branches of the search tree. Furthermore, we propose a preliminary procedure that by shrinking the feasible set improves the performances of the branching method when tackling a particular class of problems. Moreover, we prove existence of equilibria and we propose an extremely fast Jacobi-type method which leads to one equilibrium for a new class of Nash equilibrium problems with discrete strategy sets. Our numerical results show that all proposed algorithms work very well in practice

A NEW SOLUTION METHOD FOR PSEUDOMONOTONE EQUILIBRIUM PROBLEMS

Abstract We propose a new method for solving an equilibrium problem where the bifunction is pseudomonotone with respect to its solution set. This method can be considered as an extension of the one introduced by Solodov and Svaiter in [28] from variational inequality to equilibrium. An application to Nash-Cournot equilibrium models of electricity markets is discussed and its computational results are reported. Bài báo đề xuất một phương pháp mới giải bài toán cân bằng với song hàm cân bằng là giả đơn điệu theo tập nghiệm của nó. Phương pháp này là một sự mở rộng của phương pháp Solodov và Svaiter (xem Index terms Pseudomonotone equilibria, Ky Fan inequality, auxiliary subproblem principle, projection method, Armijo linesearch, Nash-Cournot equilibrium model

A new nonlocal thermodynamical equilibrium radiative transfer method for cool stars

Context: The solution of the nonlocal thermodynamical equilibrium (non-LTE) radiative transfer equation usually relies on stationary iterative methods, which may falsely converge in some cases. Furthermore, these methods are often unable to handle large-scale systems, such as molecular spectra emerging from, for example, cool stellar atmospheres. Aims: Our objective is to develop a new method, which aims to circumvent these problems, using nonstationary numerical techniques and taking advantage of parallel computers. Methods: The technique we develop may be seen as a generalization of the coupled escape probability method. It solves the statistical equilibrium equations in all layers of a discretized model simultaneously. The numerical scheme adopted is based on the generalized minimum residual method. Result:. The code has already been applied to the special case of the water spectrum in a red supergiant stellar atmosphere. This demonstrates the fast convergence of this method, and opens the way to a wide variety of astrophysical problems.Comment: 13 pages, 9 figure

An Approximate Framework for Quantum Transport Calculation with Model Order Reduction

A new approximate computational framework is proposed for computing the non-equilibrium charge density in the context of the non-equilibrium Green's function (NEGF) method for quantum mechanical transport problems. The framework consists of a new formulation, called the X-formulation, for single-energy density calculation based on the solution of sparse linear systems, and a projection-based nonlinear model order reduction (MOR) approach to address the large number of energy points required for large applied biases. The advantages of the new methods are confirmed by numerical experiments

A globally convergent neurodynamics optimization model for mathematical programming with equilibrium constraints

summary:This paper introduces a neurodynamics optimization model to compute the solution of mathematical programming with equilibrium constraints (MPEC). A smoothing method based on NPC-function is used to obtain a relaxed optimization problem. The optimal solution of the global optimization problem is estimated using a new neurodynamic system, which, in finite time, is convergent with its equilibrium point. Compared to existing models, the proposed model has a simple structure, with low complexity. The new dynamical system is investigated theoretically, and it is proved that the steady state of the proposed neural network is asymptotic stable and global convergence to the optimal solution of MPEC. Numerical simulations of several examples of MPEC are presented, all of which confirm the agreement between the theoretical and numerical aspects of the problem and show the effectiveness of the proposed model. Moreover, an application to resource allocation problem shows that the new method is a simple, but efficient, and practical algorithm for the solution of real-world MPEC problems

Asymptotically complexity diminishing schemes (ACDS) for kinetic equations in the diffusive scaling

In this work, we develop a new class of numerical schemes for collisional kinetic equations in the diffusive regime. The first step consists in reformulating the problem by decomposing the solution in the time evolution of an equilibrium state plus a perturbation. Then, the scheme combines a Monte Carlo solver for the perturbation with an Eulerian method for the equilibrium part, and is designed in such a way to be uniformly stable with respect to the diffusive scaling and to be consistent with the asymptotic diffusion equation. Moreover, since particles are only used to describe the perturbation part of the solution, the scheme becomes computationally less expensive – and is thus an asymptotically complexity diminishing scheme (ACDS) – as the solution approaches the equilibrium state due to the fact that the number of particles diminishes accordingly. This contrasts with standard methods for kinetic equations where the computational cost increases (or at least does not decrease) with the number of interactions. At the same time, the statistical error due to the Monte Carlo part of the solution decreases as the system approaches the equilibrium state: the method automatically degenerates to a solution of the macroscopic diffusion equation in the limit of infinite number of interactions. After a detailed description of the method, we perform several numerical tests and compare this new approach with classical numerical methods on various problems up to the full three dimensional case