Abstract
We consider potential games with mixed-integer variables, for which we propose two distributed, proximal-like equilibrium seeking algorithms. Specifically, we focus on two scenarios: i) the underlying game is generalized ordinal and the agents update through iterations by choosing an exact optimal strategy; ii) the game admits an exact potential and the agents adopt approximated optimal responses. By exploiting the properties of integer-compatible regularization functions used as penalty terms, we show that both algorithms converge to either an exact or an epsilon-approximate equilibrium. We corroborate our findings on a numerical instance of a Cournot oligopoly model.
Original language | English |
---|---|
Title of host publication | 2022 IEEE 61st Conference on Decision and Control (CDC) |
Pages | 4137-4142 |
Number of pages | 6 |
DOIs | |
Publication status | Published - 2022 |
Event | 2022 IEEE 61st Conference on Decision and Control - Cancun, Mexico Duration: 6 Dec 2022 → 9 Dec 2022 |
Conference
Conference | 2022 IEEE 61st Conference on Decision and Control |
---|---|
Abbreviated title | CDC 2022 |
Country/Territory | Mexico |
City | Cancun |
Period | 6/12/22 → 9/12/22 |