default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomás Prieto-Rumeau
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Héctor Jasso-Fuentes
, Tomás Prieto-Rumeau:
Constrained Markov Decision Processes with Non-constant Discount Factor. J. Optim. Theory Appl. 202(2): 897-931 (2024)- 2022
- [j16]François Dufour, Tomás Prieto-Rumeau:
Stationary Markov Nash Equilibria for Nonzero-Sum Constrained ARAT Markov Games. SIAM J. Control. Optim. 60(2): 945-967 (2022) - 2020
- [j15]Héctor Jasso-Fuentes, José-Luis Menaldi, Tomás Prieto-Rumeau:
Discrete-time control with non-constant discount factor. Math. Methods Oper. Res. 92(2): 377-399 (2020)
2010 – 2019
- 2019
- [j14]François Dufour, Tomás Prieto-Rumeau:
Approximation of Discounted Minimax Markov Control Problems and Zero-Sum Markov Games Using Hausdorff and Wasserstein Distances. Dyn. Games Appl. 9(1): 68-102 (2019) - 2018
- [j13]Jonatha Anselmi, François Dufour, Tomás Prieto-Rumeau:
Computable approximations for average Markov decision processes in continuous time. J. Appl. Probab. 55(2): 571-592 (2018) - 2016
- [j12]Tomás Prieto-Rumeau, Onésimo Hernández-Lerma:
Uniform ergodicity of continuous-time controlled Markov chains: A survey and new results. Ann. Oper. Res. 241(1-2): 249-293 (2016) - 2015
- [j11]José María Lorenzo, Ismael Hernández-Noriega, Tomás Prieto-Rumeau:
Approximation of two-person zero-sum continuous-time Markov games with average payoff criterion. Oper. Res. Lett. 43(1): 110-116 (2015) - 2013
- [j10]François Dufour, Tomás Prieto-Rumeau:
Finite Linear Programming Approximations of Constrained Discounted Markov Decision Processes. SIAM J. Control. Optim. 51(2): 1298-1324 (2013) - 2012
- [j9]Tomás Prieto-Rumeau, Onésimo Hernández-Lerma:
Discounted Continuous-Time Controlled Markov Chains: Convergence of Control Models. J. Appl. Probab. 49(4): 1072-1090 (2012) - 2010
- [j8]Tomás Prieto-Rumeau, Onésimo Hernández-Lerma:
The vanishing discount approach to constrained continuous-time controlled Markov chains. Syst. Control. Lett. 59(8): 504-509 (2010) - [j7]Tomás Prieto-Rumeau, José María Lorenzo:
Approximating Ergodic Average Reward Continuous-Time Controlled Markov Chains. IEEE Trans. Autom. Control. 55(1): 201-207 (2010)
2000 – 2009
- 2009
- [j6]Tomás Prieto-Rumeau, Onésimo Hernández-Lerma:
Variance minimization and the overtaking optimality approach to continuous-time controlled Markov chains. Math. Methods Oper. Res. 70(3): 527-540 (2009) - [c1]Tomás Prieto-Rumeau, Onésimo Hernández-Lerma:
Ergodic control of continuous-time Markov chains with pathwise constraints. CDC 2009: 2640-2645 - 2008
- [j5]Tomás Prieto-Rumeau, Onésimo Hernández-Lerma:
Ergodic Control of Continuous-Time Markov Chains with Pathwise Constraints. SIAM J. Control. Optim. 47(4): 1888-1908 (2008) - 2006
- [j4]Tomás Prieto-Rumeau, Onésimo Hernández-Lerma:
Bias Optimality for Continuous-Time Controlled Markov Chains. SIAM J. Control. Optim. 45(1): 51-73 (2006) - 2005
- [j3]Tomás Prieto-Rumeau, Onésimo Hernández-Lerma:
The Laurent series, sensitive discount and Blackwell optimality for continuous-time controlled Markov chains. Math. Methods Oper. Res. 61(1): 123-145 (2005) - [j2]Tomás Prieto-Rumeau, Onésimo Hernández-Lerma:
Bias and overtaking equilibria for zero-sum continuous-time Markov games. Math. Methods Oper. Res. 61(3): 437-454 (2005) - 2004
- [j1]Tomás Prieto-Rumeau:
Estimation of an optimal solution of a LP problem with unknown objective function. Math. Program. 101(3): 463-478 (2004)
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-09-22 00:39 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:
