Solving the k-winners-take-all problem and the oligopoly cournot-nash equilibrium problem using the general projection neural networks

Xiaolin Hu, Jun Wang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationNeural Information Processing - 14th International Conference, ICONIP 2007, Revised Selected Papers
Pages703-712
Number of pages10
EditionPART 1
DOIs
Publication statusPublished - 2008
Externally publishedYes
Event14th International Conference on Neural Information Processing, ICONIP 2007 - Kitakyushu, Japan
Duration: 13 Nov 200716 Nov 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume4984 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th International Conference on Neural Information Processing, ICONIP 2007
Country/TerritoryJapan
CityKitakyushu
Period13/11/0716/11/07

Fingerprint

Dive into the research topics of 'Solving the k-winners-take-all problem and the oligopoly cournot-nash equilibrium problem using the general projection neural networks'. Together they form a unique fingerprint.

Cite this