The k-winners-take-all (k-WTA) problem is to select k largest inputs from a set of inputs in a network, which has many applications in machine learning. The Cournot-Nash equilibrium is an important problem in economic models . The two problems can be formulated as linear variational inequalities (LVIs). In the paper, a linear case of the general projection neural network (GPNN) is applied for solving the resulting LVIs, and consequently the two practical problems. Compared with existing recurrent neural networks capable of solving these problems, the designed GPNN is superior in its stability results and architecture complexity. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Hu, X., & Wang, J. (2008). Solving the k-winners-take-all problem and the oligopoly cournot-nash equilibrium problem using the general projection neural networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4984 LNCS, pp. 703–712). https://doi.org/10.1007/978-3-540-69158-7_73
Mendeley helps you to discover research relevant for your work.