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

Xiaolin Hu; Jun Wang

doi:10.1007/978-3-540-69158-7_73

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: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-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. © 2008 Springer-Verlag Berlin Heidelberg.

Original language	English
Title of host publication	Neural Information Processing
Subtitle of host publication	14th International Conference, ICONIP 2007, Revised Selected Papers
Publisher	Springer Verlag
Pages	703-712
Volume	4984 LNCS
ISBN (Print)	3540691545, 9783540691549
DOIs	https://doi.org/10.1007/978-3-540-69158-7_73
Publication status	Published - 2008
Externally published	Yes
Event	14th International Conference on Neural Information Processing, ICONIP 2007 - Kitakyushu, Japan Duration: 13 Nov 2007 → 16 Nov 2007

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4984 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	14th International Conference on Neural Information Processing, ICONIP 2007
Place	Japan
City	Kitakyushu
Period	13/11/07 → 16/11/07

Access Output

10.1007/978-3-540-69158-7_73

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

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 Neural Information Processing: 14th International Conference, ICONIP 2007, Revised Selected Papers (Vol. 4984 LNCS, pp. 703-712). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4984 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-69158-7_73

Hu, Xiaolin ; Wang, Jun. / Solving the k-winners-take-all problem and the oligopoly cournot-nash equilibrium problem using the general projection neural networks. Neural Information Processing: 14th International Conference, ICONIP 2007, Revised Selected Papers. Vol. 4984 LNCS Springer Verlag, 2008. pp. 703-712 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{64f153f71b1e4502a7efcaa59340c98b,

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

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. {\textcopyright} 2008 Springer-Verlag Berlin Heidelberg.",

author = "Xiaolin Hu and Jun Wang",

year = "2008",

doi = "10.1007/978-3-540-69158-7\_73",

language = "English",

isbn = "3540691545",

volume = "4984 LNCS",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "703--712",

booktitle = "Neural Information Processing",

address = "Germany",

note = "14th International Conference on Neural Information Processing, ICONIP 2007 ; Conference date: 13-11-2007 Through 16-11-2007",

}

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 Neural Information Processing: 14th International Conference, ICONIP 2007, Revised Selected Papers. vol. 4984 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4984 LNCS, Springer Verlag, pp. 703-712, 14th International Conference on Neural Information Processing, ICONIP 2007, Kitakyushu, Japan, 13/11/07. https://doi.org/10.1007/978-3-540-69158-7_73

Solving the k-winners-take-all problem and the oligopoly cournot-nash equilibrium problem using the general projection neural networks. / Hu, Xiaolin; Wang, Jun.
Neural Information Processing: 14th International Conference, ICONIP 2007, Revised Selected Papers. Vol. 4984 LNCS Springer Verlag, 2008. p. 703-712 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4984 LNCS).

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

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

AU - Hu, Xiaolin

AU - Wang, Jun

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/54249147708

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-54249147708&origin=recordpage

U2 - 10.1007/978-3-540-69158-7_73

DO - 10.1007/978-3-540-69158-7_73

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 3540691545

SN - 9783540691549

VL - 4984 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 703

EP - 712

BT - Neural Information Processing

PB - Springer Verlag

T2 - 14th International Conference on Neural Information Processing, ICONIP 2007

Y2 - 13 November 2007 through 16 November 2007

ER -

Hu X, Wang J. Solving the k-winners-take-all problem and the oligopoly cournot-nash equilibrium problem using the general projection neural networks. In Neural Information Processing: 14th International Conference, ICONIP 2007, Revised Selected Papers. Vol. 4984 LNCS. Springer Verlag. 2008. p. 703-712. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-69158-7_73

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

Abstract

Publication series

Conference

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this