default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRaúl Montes-de-Oca
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j28]Rolando Cavazos-Cadena, Hugo Cruz-Suárez
, Raúl Montes-de-Oca:
Characterization of the optimal average cost in Markov decision chains driven by a risk-seeking controller. J. Appl. Probab. 61(1): 340-367 (2024)- 2023
- [j27]Rolando Cavazos-Cadena, Hugo Cruz-Suárez, Raúl Montes-de-Oca:
Average criteria in denumerable semi-Markov decision chains under risk-aversion. Discret. Event Dyn. Syst. 33(3): 221-256 (2023) - 2021
- [j26]Rubén Becerril-Borja, Raúl Montes-de-Oca:
Incomplete information and risk sensitive analysis of sequential games without a predetermined order of turns. Kybernetika 57(2): 312-331 (2021) - [c7]Karla Carrero-Vera, Hugo Cruz-Suárez, Raúl Montes-de-Oca:
Discounted Markov Decision Processes with Fuzzy Rewards Induced by Non-fuzzy Systems. ICORES 2021: 49-59 - [c6]Karla Carrero-Vera, Hugo Cruz-Suárez, Raúl Montes-de-Oca:
Finite-Horizon and Infinite-Horizon Markov Decision Processes with Trapezoidal Fuzzy Discounted Rewards. ICORES (Selected Papers) 2021: 171-192
2010 – 2019
- 2019
- [j25]Francisco J. González-Padilla, Raúl Montes-de-Oca:
Nash ε-equilibria for stochastic games with total reward functions: an approach through Markov decision processes. Kybernetika 55(1): 152-165 (2019) - 2017
- [c5]Raúl Montes-de-Oca, Patricia Saavedra, Gabriel Zacarías-Espinoza, Daniel Cruz-Suárez:
Optimal Policies for Payment of Dividends through a Fixed Barrier at Discrete Time. ICORES 2017: 140-149 - [c4]Carlos Martínez-Rodríguez, Raúl Montes-de-Oca, Patricia Saavedra:
Network of M/M/1 Cyclic Polling Systems. ICORES 2017: 298-305 - 2016
- [j24]R. Israel Ortega-Gutiérrez, Raúl Montes-de-Oca, Enrique Lemus-Rodríguez:
Uniqueness of optimal policies as a generic property of discounted Markov decision processes: Ekeland's variational principle approach. Kybernetika 52(1): 66-75 (2016) - [c3]Rubén Becerril-Borja, Raúl Montes-de-Oca:
A Family of Models for Finite Sequential Games Without a Predetermined Order of Turns. ICORES (Selected Papers) 2016: 35-51 - [c2]Rubén Becerril-Borja, Raúl Montes-de-Oca:
Sequential Games with Finite Horizon and Turn Selection Process - Finite Strategy Sets Case. ICORES 2016: 44-50 - 2015
- [j23]Rolando Cavazos-Cadena, Raúl Montes-de-Oca, Karel Sladký:
Sample-Path Optimal Stationary Policies in Stable Markov Decision Chains with the Average Reward Criterion. J. Appl. Probab. 52(2): 419-440 (2015) - 2014
- [j22]Hugo Cruz-Suárez, Rocio Ilhuicatzi-Roldán, Raúl Montes-de-Oca:
Markov Decision Processes on Borel Spaces with Total Cost and Random Horizon. J. Optim. Theory Appl. 162(1): 329-346 (2014) - [j21]Rolando Cavazos-Cadena, Raúl Montes-de-Oca, Karel Sladký:
A Counterexample on Sample-Path Optimality in Stable Markov Decision Chains with the Average Reward Criterion. J. Optim. Theory Appl. 163(2): 674-684 (2014) - [j20]Raúl Montes-de-Oca, Elena Zaitseva:
About stability of risk-seeking optimal stopping. Kybernetika 50(3): 378-392 (2014) - 2013
- [j19]Raúl Montes-de-Oca, Enrique Lemus-Rodríguez, Francisco Salem-Silva:
Nonuniqueness versus Uniqueness of Optimal Policies in Convex Discounted Markov Decision Processes. J. Appl. Math. 2013: 271279:1-271279:5 (2013) - 2012
- [j18]Raúl Montes-de-Oca, Enrique Lemus-Rodríguez:
An unbounded Berge's minimum theorem with applications to discounted Markov decision processes. Kybernetika 48(2): 268-286 (2012) - 2011
- [j17]Rosa María Flores-Hernández, Raúl Montes-de-Oca:
Noncooperative games with noncompact joint strategies sets: Increasing best responses and approximation to equilibrium points. Kybernetika 47(2): 207-221 (2011) - [j16]Hugo Cruz-Suárez, Raúl Montes-de-Oca, Gabriel Zacarías-Espinoza:
A consumption-investment problem modelled as a discounted Markov decision process. Kybernetika 47(6): 909-929 (2011)
2000 – 2009
- 2009
- [j15]Hugo Cruz-Suárez, Evgueni Gordienko, Raúl Montes-de-Oca:
A note on deterministic approximation of discounted Markov decision processes. Appl. Math. Lett. 22(8): 1252-1256 (2009) - [j14]Raúl Montes-de-Oca, Daniel Cruz-Suárez, Enrique Lemus-Rodríguez:
A Stopping Rule for Discounted Markov Decision Processes with Finite Action Sets. Kybernetika 45(5): 755-767 (2009) - [j13]Evgueni Gordienko, Enrique Lemus-Rodríguez, Raúl Montes-de-Oca:
Average cost Markov control processes: stability with respect to the Kantorovich metric. Math. Methods Oper. Res. 70(1): 13-33 (2009) - 2008
- [j12]Hugo Cruz-Suárez, Raúl Montes-de-Oca:
An envelope theorem and some applications to discounted Markov decision processes. Math. Methods Oper. Res. 67(2): 299-321 (2008) - [j11]Evgueni Gordienko, Enrique Lemus-Rodríguez, Raúl Montes-de-Oca:
Discounted cost optimality problem: stability with respect to weak metrics. Math. Methods Oper. Res. 68(1): 77-96 (2008) - 2007
- [j10]Rosa María Flores-Hernández, Raúl Montes-de-Oca:
Monotonicity of minimizers in optimization problems with applications to Markov control processes. Kybernetika 43(3): 347-368 (2007) - [c1]Karel Sladký, Raúl Montes-de-Oca:
Risk-Sensitive Average Optimality in Markov Decision Chains. OR 2007: 69-74 - 2006
- [j9]Hugo Cruz-Suárez, Raúl Montes-de-Oca:
Discounted Markov control processes induced by deterministic systems. Kybernetika 42(6): 647-664 (2006) - 2005
- [j8]Raúl Montes-de-Oca, Francisco Salem-Silva:
Estimates for perturbations of average Markov decision processes with a minimal state and upper bounded by stochastically ordered Markov chains. Kybernetika 41(6): 757-772 (2005) - 2004
- [j7]Daniel Cruz-Suárez, Raúl Montes-de-Oca, Francisco Salem-Silva:
Conditions for the uniqueness of optimal policies of discounted Markov decision processes. Math. Methods Oper. Res. 60(3): 415-436 (2004) - 2003
- [j6]Rolando Cavazos-Cadena, Raúl Montes-de-Oca:
The Value Iteration Algorithm in Risk-Sensitive Average Markov Decision Chains with Finite State Space. Math. Oper. Res. 28(4): 752-776 (2003) - 2000
- [j5]Rolando Cavazos-Cadena, Raúl Montes-de-Oca:
Nearly optimal policies in risk-sensitive positive dynamic programming on discrete spaces. Math. Methods Oper. Res. 52(1): 133-167 (2000) - [j4]Rolando Cavazos-Cadena, Eugene A. Feinberg, Raúl Montes-de-Oca:
A Note on the Existence of Optimal Policies in Total Reward Dynamic Programs with Compact Action Sets. Math. Oper. Res. 25(4): 657-666 (2000)
1990 – 1999
- 1999
- [j3]Rolando Cavazos-Cadena, Raúl Montes-de-Oca:
Nearly optimal stationary policies in negative dynamic programming. Math. Methods Oper. Res. 49(3): 441-456 (1999) - 1998
- [j2]Oscar Vega-Amaya, Raúl Montes-de-Oca:
Application of average dynamic programming to inventory systems. Math. Methods Oper. Res. 47(3): 451-471 (1998) - 1997
- [j1]Evgueni Gordienko, Raúl Montes-de-Oca, J. Adolfo Minjárez-Sosa:
Approximation of average cost optimal policies for general Markov decision processes with unbounded costs. Math. Methods Oper. Res. 45(2): 245-263 (1997)
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-05-06 20:26 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:
