A Log-domain Interior Point Method for Convex Quadratic Games
<|reference_start|>A Log-domain Interior Point Method for Convex Quadratic Games: 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.<|reference_end|>
@article{liu2024a,
    title={A Log-domain Interior Point Method for Convex Quadratic Games},
    author={Bingqi Liu, Dominic Liao-McPherson},
    journal={arXiv preprint arXiv:2403.13290},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.13290},
    primaryClass={math.OC cs.SY eess.SY}
}