By Topic

Neural networks realization of searching models for Nash equilibrium points and their application to associative memories

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Horie, R. ; Dept. of Instrum. Eng., Keio Univ., Yokohama, Japan ; Aiyoshi, E.

We propose a new mutually coupled plural neural networks (NN) modules and its application to associative memories from the view point of noncooperative game theory. First, we propose a new dynamical searching model named parallel steepest descent method with braking operators (PSDMB) which searches the Nash equilibrium (NE) points under [0, 1]-interval or nonnegative constraints. Second, we propose a new mutually coupled plural NN modules named game neural networks (GNN) to realize the proposed PSDMB with quadratic objective functions. In addition, we indicate relations between the PSDMB, the GNN and the Lotka-Volterra equation. Last, for an application of the proposed GNN, we propose two kinds of multimodular associative memories which can associate the combined patterns composed of plural partial patterns: (1) the combined patterns are stored as the NE points and robust for noisy inputs; (2) the circulative sequence of the combined patterns are stored as saddles of a heteroclinic cycle

Published in:

Systems, Man, and Cybernetics, 1998. 1998 IEEE International Conference on  (Volume:2 )

Date of Conference:

11-14 Oct 1998