Abstract
A problem in visual labeling and artificial neural networks, equivalent to finding Nash equilibria for polymatrix n-person games, may be solved by the copositive-plus Lemke algorithm. Analysis suggests efficiency improves Howson's recursive method by O( n −1) and is same order as Eaves' L 2-formulation. Method extends to any dynamical system p′ = Rp + c, Ap ≤ q, p ≥ 0.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
