On the public citation graph
Conditional Distributionally Robust Functionals
0 signed · 24 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/s10107-015-0896-zopenalex-snapshot
A distributionally robust perspective on uncertainty quantification and chance constrained programming
inferredcites →https://doi.org/10.1007/s10479-019-03431-8openalex-snapshot
A survey of decision making and optimization under uncertainty
inferredcites →https://doi.org/10.1016/j.ejor.2011.11.005openalex-snapshot
Minimax and risk averse multistage stochastic programming
inferredcites →https://doi.org/10.1016/j.ejor.2015.02.033openalex-snapshot
Time-inconsistent multistage stochastic programs: Martingale bounds
inferredcites →https://doi.org/10.1016/j.orl.2017.05.008openalex-snapshot
Interchangeability principle and dynamic equations in risk averse stochastic programming
inferredcites →https://doi.org/10.1016/j.spa.2004.03.004openalex-snapshot
Dynamic coherent risk measures
inferredcites →https://doi.org/10.1016/s0304-0208(08)x7141-5openalex-snapshot
Probabilities and Potential
inferredcites →https://doi.org/10.1111/j.1467-9965.2007.00311.xopenalex-snapshot
AN OLD‐NEW CONCEPT OF CONVEX RISK MEASURES: THE OPTIMIZED CERTAINTY EQUIVALENT
inferredcites →https://doi.org/10.1137/080718401openalex-snapshot
Version-Independence and Nested Distributions in Multistage Stochastic Optimization
inferredcites →https://doi.org/10.1137/1.9780898718751openalex-snapshot
Lectures on Stochastic Programming
inferredcites →https://doi.org/10.1137/110825054openalex-snapshot
A Distance For Multistage Stochastic Optimization Models
inferredcites →https://doi.org/10.1137/21m1390517openalex-snapshot
Mathematical Foundations of Distributionally Robust Multistage Optimization
inferredcites →https://doi.org/10.1143/jpsj.18.328openalex-snapshot
Markov Processes and the H -Theorem
inferredcites →https://doi.org/10.1287/educ.2015.0134openalex-snapshot
Data-Driven Stochastic Programming Using Phi-Divergences
inferredcites →https://doi.org/10.1287/moor.2015.0732openalex-snapshot
Convergence Analysis for Distributionally Robust Optimization and Equilibrium Problems
inferredcites →https://doi.org/10.1287/opre.2014.1314openalex-snapshot
Distributionally Robust Convex Optimization
inferredcites →https://doi.org/10.2307/1884324openalex-snapshot
Risk, Ambiguity, and the Savage Axioms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4535983openalex-extracted
Distributionally Robust Multi-Stage Decision Problem and Satisficing
inferred← citeshttps://doi.org/10.1016/j.orl.2024.107234openalex-snapshot
Distributionally robust stochastic optimal control
inferred← citeshttps://doi.org/10.1109/cdc57313.2025.11312158openalex-snapshot
Distributionally Robust Cascading Risk Quantification in Multi-Agent Rendezvous: Effects of Time Delay and Network Connectivity
inferred← citeshttps://doi.org/10.2139/ssrn.5381104openalex-snapshot
Distributionally Robust Multi-stage Decision Problem and Satisficing
inferred← citeshttps://doi.org/10.23919/acc60939.2024.10644661openalex-snapshot
Data-Driven Distributionally Robust Mitigation of Risk of Cascading Failures
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.