A Log-domain Interior Point Method for Convex Quadratic Games

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Liu, Bingqi, Liao-McPherson, Dominic
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866910375043137536
author Liu, Bingqi
Liao-McPherson, Dominic
author_facet Liu, Bingqi
Liao-McPherson, Dominic
contents In this paper, we propose an equilibrium-seeking algorithm for finding generalized Nash equilibria of non-cooperative monotone convex quadratic games. Specifically, we recast the Nash equilibrium-seeking problem as variational inequality problem that we solve using a log-domain interior point method and provide a general purpose solver based on this algorithm. This approach is suitable for non-potential, general sum games and does not require extensive structural assumptions. We demonstrate the efficiency and versatility of our method using three benchmark games and demonstrate our algorithm is especially effective on small to medium scale problems.
format Preprint
id arxiv_https___arxiv_org_abs_2403_13290
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle A Log-domain Interior Point Method for Convex Quadratic Games
Liu, Bingqi
Liao-McPherson, Dominic
Optimization and Control
Systems and Control
In this paper, we propose an equilibrium-seeking algorithm for finding generalized Nash equilibria of non-cooperative monotone convex quadratic games. Specifically, we recast the Nash equilibrium-seeking problem as variational inequality problem that we solve using a log-domain interior point method and provide a general purpose solver based on this algorithm. This approach is suitable for non-potential, general sum games and does not require extensive structural assumptions. We demonstrate the efficiency and versatility of our method using three benchmark games and demonstrate our algorithm is especially effective on small to medium scale problems.
title A Log-domain Interior Point Method for Convex Quadratic Games
topic Optimization and Control
Systems and Control
url https://arxiv.org/abs/2403.13290