default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYaning Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Wenhui Gao, Yaning Lin
:
Open-loop and closed-loop Nash equilibria for the LQ stochastic difference game. J. Comput. Appl. Math. 443: 115746 (2024)- [j15]Wenhui Gao, Yaning Lin, Weihai Zhang:
Incentive Feedback Stackelberg Strategy in Mean-Field Type Stochastic Difference Games. J. Syst. Sci. Complex. 37(4): 1425-1445 (2024) - 2023
- [j14]Wenhui Gao, Yaning Lin, Weihai Zhang:
Incentive feedback Stackelberg strategy for the discrete-time stochastic systems. J. Frankl. Inst. 360(3): 2404-2420 (2023) - [j13]Yaning Lin, Weihai Zhang:
Feedback Stackelberg Solution for Mean-Field Type Stochastic Systems with Multiple Followers. J. Syst. Sci. Complex. 36(4): 1519-1539 (2023) - 2022
- [j12]Yaning Lin, Wenhui Gao, Weihai Zhang:
Incentive feedback Stackelberg strategy for stochastic systems with state-dependent noise. J. Frankl. Inst. 359(5): 2058-2072 (2022) - 2021
- [j11]Yaning Lin:
Linear quadratic open-loop Stackelberg game for stochastic systems with Poisson jumps. J. Frankl. Inst. 358(10): 5262-5280 (2021) - [j10]Yaning Lin, Weihai Zhang:
Pareto efficiency in the infinite horizon mean-field type cooperative stochastic differential game. J. Frankl. Inst. 358(10): 5532-5551 (2021) - 2020
- [j9]Yaning Lin:
Necessary/sufficient conditions for Pareto optimality in finite horizon mean-field type stochastic differential game. Autom. 119: 108951 (2020)
2010 – 2019
- 2019
- [j8]Yaning Lin:
Feedback Stackelberg strategies for the discrete-time mean-field stochastic systems in infinite horizon. J. Frankl. Inst. 356(10): 5222-5239 (2019) - [j7]Yaning Lin:
Linear Quadratic Pareto Game of the Stochastic Systems in Infinite Horizon. J. Optim. Theory Appl. 183(2): 671-687 (2019) - [j6]Yaning Lin, Xiushan Jiang, Weihai Zhang:
An Open-Loop Stackelberg Strategy for the Linear Quadratic Mean-Field Stochastic Differential Game. IEEE Trans. Autom. Control. 64(1): 97-110 (2019) - 2018
- [j5]Yaning Lin, Tianliang Zhang, Weihai Zhang:
Pareto-based guaranteed cost control of the uncertain mean-field stochastic systems in infinite horizon. Autom. 92: 197-209 (2018) - [j4]Yaning Lin, Xiushan Jiang, Weihai Zhang:
Necessary and sufficient conditions for Pareto optimality of the stochastic systems in finite horizon. Autom. 94: 341-348 (2018) - [j3]Yaning Lin, Tianliang Zhang, Weihai Zhang:
Infinite horizon linear quadratic Pareto game of the stochastic singular systems. J. Frankl. Inst. 355(10): 4436-4452 (2018) - 2017
- [j2]Weihai Zhang, Yaning Lin, Ling-Rong Xue:
Linear quadratic Pareto optimal control problem of stochastic singular systems. J. Frankl. Inst. 354(2): 1220-1238 (2017) - 2016
- [j1]Ling-Rong Xue, Weihai Zhang, Yaning Lin:
Global output tracking control for high-order stochastic nonlinear systems with SISS inverse dynamics and time-varying delays. J. Frankl. Inst. 353(13): 3249-3270 (2016)
Coauthor Index
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 2024-06-26 21:18 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:
