A BIO-inspired optimization algorithm named deflective Memetic algorithm for detecting multi-minima of multimodal functions is proposed. The Nash Equilibria detecting in game theory is used to test the proposed algorithm. The basic Memetic Algorithm is constructed of particle swarm optimization as global search and Tabu search as local search. Two improvements are incorporated to enhance PSO. Tabu search iterates through the neighborhood to get a local optimum. Deflective technique is incorporated to tune the search for multi minima. The performance is evaluated on a series of Nash Equilibria detecting examples. The results show that the deflective MA has a notable ability to detect multi minima while yielding high accuracy and performance.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Nash Equilibrium Computing Based on Deflective Memetic Algorithm


    Beteiligte:
    Jiao-jiao, Gu (Autor:in) / Da-peng, Sui (Autor:in) / Peng-fei, Fu (Autor:in)


    Erscheinungsdatum :

    2018-08-01


    Format / Umfang :

    669803 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Essays on Nash equilibrium refinements

    De Stefano, Federico | BASE | 2015

    Freier Zugriff


    An Asynchronous, Forward-Backward, Distributed Generalized Nash Equilibrium Seeking Algorithm (I)

    Cenedese, Carlo / Belgioioso, Giuseppe / Grammatico, Sergio et al. | BASE | 2019

    Freier Zugriff

    Probably approximately correct Nash equilibrium learning

    Fele, F / Margellos, K | BASE | 2020

    Freier Zugriff