Optimización de modelos de Stackelberg no estacionarios mediante un algoritmo evolutivo auto-adaptativo

  1. Fuentes, Olga P. Cedeño 1
  2. Castro, Lorena Arboleda 1
  3. Sánchez, Iván Jacho 1
  4. Hernández, Pavel Novoa 1
  1. 1 Universidad Técnica Estatal de Quevedo
    info

    Universidad Técnica Estatal de Quevedo

    Quevedo, Ecuador

    ROR https://ror.org/05qrwjj27

Journal:
TecnoLógicas

ISSN: 2256-5337 0123-7799

Year of publication: 2017

Issue Title: May - August 2017

Volume: 20

Issue: 39

Pages: 185-195

Type: Article

DOI: 10.22430/22565337.715 DIALNET GOOGLE SCHOLAR lock_openDialnet editor

More publications in: TecnoLógicas

Abstract

Stackelberg’s game models involve an important family of Game Theory problems with direct application on economics scenarios. Their main goal is to find an optimal equilibrium between the decisions from two actors that are related one to each other hierarchically. In general, these models are complex to solve due to their hierarchical structure and intractability from an analytical viewpoint. Another reason for such a complexity comes from the presence of uncertainty, which often occurs because of the variability over time of market conditions, adversary strategies, among others aspects. Despite their importance, related literature reflects a few works addressing this kind of non-stationary optimization problems. So, in order to contribute to this research area, the present work proposes a self-adaptive meta-heuristic method for solving online Stackelberg’s games. Experiment results show a significant improvement over an existing method.