Sliding-Mode Nash Equilibrium Seeking for a Quadratic Duopoly Game

This paper introduces a new method to achieve stable convergence to Nash equilibrium in duopoly noncooperative games. Inspired by the recent fixed-time Nash Equilibrium seeking (NES) [30] as well as prescribed-time extremum seeking (ES) [34] and source seeking [33] schemes, our approach employs a distributed sliding mode control (SMC) scheme, integrating extremum seeking with sinusoidal perturbation signals to estimate the pseudogradients of quadratic payoff functions. Notably, this is the first attempt to address noncooperative games without relying on models, combining classical extremum seeking with relay components instead of proportional control laws. We prove finite-time convergence of the closed-loop average system to Nash equilibrium using stability analysis techniques such as time-scaling, Lyapunov’s direct method, and averaging theory for discontinuous systems. Additionally, we quantify the size of residual sets around the Nash equilibrium and validate our theoretical results through simulations.

Authors

Institutions

Publication Details

Published
2024-10-21
DOI
https://doi.org/10.1109/vss61690.2024.10753377
Citations
3
Primary Topic
Merger and Competition Analysis
Type
article
Field-Weighted Citation Impact
3.39

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Sliding-Mode Nash Equilibrium Seeking for a Quadratic Duopoly Game

Miroslav Krstić, Tamer Başar, Tiago Roux Oliveira, Victor Hugo Pereira Rodrigues
3 citations
Merger and Competition Analysis
3.39
article

Sliding-Mode Nash Equilibrium Seeking for a Quadratic Duopoly Game

Miroslav Krstić, Tamer Başar, Tiago Roux Oliveira, Victor Hugo Pereira Rodrigues
article en
3 citations

Abstract

This paper introduces a new method to achieve stable convergence to Nash equilibrium in duopoly noncooperative games. Inspired by the recent fixed-time Nash Equilibrium seeking (NES) [30] as well as prescribed-time extremum seeking (ES) [34] and source seeking [33] schemes, our approach employs a distributed sliding mode control (SMC) scheme, integrating extremum seeking with sinusoidal perturbation signals to estimate the pseudogradients of quadratic payoff functions. Notably, this is the first attempt to address noncooperative games without relying on models, combining classical extremum seeking with relay components instead of proportional control laws. We prove finite-time convergence of the closed-loop average system to Nash equilibrium using stability analysis techniques such as time-scaling, Lyapunov’s direct method, and averaging theory for discontinuous systems. Additionally, we quantify the size of residual sets around the Nash equilibrium and validate our theoretical results through simulations.

University of Illinois Urbana-Champaign (US), University of California San Diego (US), Universidade do Estado do Rio de Janeiro (BR)
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
Openalex Percentile: Top 6%
Merger and Competition Analysis
3.39
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Sliding-Mode Nash Equilibrium Seeking for a Quadratic Duopoly Game — Miroslav Krstić, Tamer Başar, et al. · (2024) | TGRS Research Map | TGRS