default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMiroslav Krstic
- > Home > Persons > Miroslav Krstic
Publications
- 2025
[c329]Michael Tang, Miroslav Krstic, Jorge Poveda:
Stochastic Real-Time Deception in Nash Equilibrium Seeking for Games with Quadratic Payoffs. L4DC 2025: 635-646- [i108]Nicolás Espitia, Miroslav Krstic, Jorge I. Poveda:
Prescribed-Time Newton Extremum Seeking using Delays and Time-Periodic Gains. CoRR abs/2502.05464 (2025) - [i106]Michael Tang, Miroslav Krstic, Jorge Poveda:
Stochastic Real-Time Deception in Nash Equilibrium Seeking for Games with Quadratic Payoffs. CoRR abs/2502.12337 (2025) - [i100]Michael Tang, Miroslav Krstic, Jorge Poveda:
Deception in Oligopoly Games via Adaptive Nash Seeking Systems. CoRR abs/2505.24112 (2025) - 2024
- [c321]Michael Tang, Miroslav Krstic, Jorge I. Poveda:
On Fixed-Time Stability for a Class of Singularly Perturbed Systems Using Composite Lyapunov Functions. ACC 2024: 4783-4788 - [c312]Michael Tang, Miroslav Krstic, Jorge I. Poveda:
Filterless Fixed-Time Extremum Seeking for Scalar Quadratic Maps. CDC 2024: 5256-5261 - [i79]Michael Tang, Umar Javed, Xudong Chen, Miroslav Krstic, Jorge I. Poveda:
Deception in Nash Equilibrium Seeking. CoRR abs/2407.05168 (2024) - [i77]Michael Tang, Miroslav Krstic, Jorge Poveda:
On Fixed-Time Stability for a Class of Singularly Perturbed Systems using Composite Lyapunov Functions. CoRR abs/2408.16905 (2024) - [i71]Michael Tang, Miroslav Krstic, Jorge Poveda:
Fixed-Time Input-to-State Stability for Singularly Perturbed Systems via Composite Lyapunov Functions. CoRR abs/2412.16797 (2024) - 2023
- [j310]Jorge I. Poveda
, Miroslav Krstic, Tamer Basar:
Fixed-Time Nash Equilibrium Seeking in Time-Varying Networks. IEEE Trans. Autom. Control. 68(4): 1954-1969 (2023) - 2022
- [c290]Jorge I. Poveda, Miroslav Krstic, Tamer Basar:
Fixed-Time Seeking and Tracking of Time-Varying Nash Equilibria in Noncooperative Games. ACC 2022: 794-799 - 2021
- [j263]Jorge I. Poveda, Miroslav Krstic:
Nonsmooth Extremum Seeking Control With User-Prescribed Fixed-Time Convergence. IEEE Trans. Autom. Control. 66(12): 6156-6163 (2021) - [c270]Jorge I. Poveda, Miroslav Krstic:
Fixed-Time Seeking and Tracking of Time-Varying Extrema. CDC 2021: 108-113 - 2020
- [c260]Jorge I. Poveda, Miroslav Krstic:
Fixed-Time Gradient-Based Extremum Seeking. ACC 2020: 2838-2843 - [c254]Jorge I. Poveda, Miroslav Krstic, Tamer Basar:
Fixed-Time Nash Equilibrium Seeking in Non-Cooperative Games. CDC 2020: 3514-3519
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-08-23 22:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
