Distributionally-Robust Competitive Ratio

• DRCR is a performance measure that defines the maximally robust fraction of optimality under partial or imprecise distributional information.
• It leverages semi-infinite linear programming and moment-based techniques to identify worst-case, two- or three-point extremal distributions.
• The framework applies to online algorithms and pricing strategies, yielding closed-form decision rules and actionable insights for robust decision-making.

The distributionally-robust competitive ratio (DRCR) is a performance measure that captures the maximally robust fraction of optimality attainable in optimization under partial, distributional, or information-theoretic ambiguity. The DRCR framework unifies classical adversarial competitive analysis with settings where some (possibly imprecise or probabilistic) predictions are available, quantifying the effectiveness of algorithms or strategies against worst-case compatible distributions. DRCR arises naturally in single-parameter pricing, online algorithms with predictions, and related domains where robustness to distributional uncertainty is paramount (Eck et al., 8 Sep 2025, Yoshinaga et al., 11 Jan 2026).

1. Formal Definitions and Framework

Given a generic optimization problem, consider an algorithm or policy $A$ and a universe of instances $\mathcal{I}$ governed by an (unknown) distribution $P$. For minimization (or cost) problems, DRCR evaluates the expected cost ratio between $A$ and the offline optimum, maximizing over all distributions in a specified ambiguity set.

• Cost-based DRCR. For an online minimization problem and a prediction $(\Theta,\alpha)$ with $\Theta\subseteq\mathcal{I}$ and $\alpha\in[0,1]$, the ambiguity set is $$\mathcal{D}(\Theta,\alpha)=\{P:\Pr_{I\sim P}(I\in\Theta)\ge\alpha\}$$. The DRCR of $A$ is

$$\mathrm{DRCR}_{\Theta,\alpha}(A) = \sup_{P\in\mathcal{D}(\Theta,\alpha)} \mathbb{E}_{I\sim P}\left[\frac{\mathrm{ALG}(I)}{\mathrm{OPT}(I)}\right]$$

• Revenue-based DRCR. In deterministic monopoly pricing with partially known market statistics, suppose $X$ is a random valuation, and for a posted price $p$, expected revenue is $\mathrm{REV}(p,P) = pP(X\ge p)$. The ambiguity set is

$$\mathcal{P}(\mu, s, \beta, \varphi) = \left\{P: P(X\in[0,\beta])=1,~ \mathbb{E}_P[X]=\mu,~ \mathbb{E}_P[\varphi(X)]=s\right\}$$

The DRCR is then

$$\mathrm{DRCR}(\mu, s, \beta, \varphi) = \sup_{p>0} \inf_{P\in\mathcal{P}(\mu,s,\beta,\varphi)} \frac{\mathrm{REV}(p,P)}{\sup_{t>0} \mathrm{REV}(t,P)}$$

(Eck et al., 8 Sep 2025).

The DRCR thus captures the best guarantee—fraction of optimal performance—that can be ensured across all distributions satisfying known constraints or predictions.

2. Structural Properties and Decompositions

For fixed algorithms or pricing strategies, the DRCR in prediction-augmented online problems is a linear function of prediction accuracy. Specifically, given consistency $$c(A) = \sup_{I\in\Theta} \mathrm{ALG}(I)/\mathrm{OPT}(I)$$ and robustness $$r(A) = \sup_{I\in \mathcal{I}} \mathrm{ALG}(I)/\mathrm{OPT}(I)$$, it holds that

$$\mathrm{DRCR}_{\Theta,\alpha}(A) = \alpha\, c(A) + (1-\alpha) r(A)$$

(Yoshinaga et al., 11 Jan 2026).

When optimizing over all algorithms:

$$\mathrm{DRCR}^*(\alpha) = \inf_A\left\{ (1-\alpha) r(A) + \alpha c(A) \right\}$$

This function is always concave and nonincreasing in $\alpha$, representing a robustness–consistency trade-off interpolating between worst-case and perfect-prediction regimes.

In robust pricing, the inner minimization for a fixed price $p$ decomposes as (Eck et al., 8 Sep 2025):

$$\inf_{P\in\mathcal{P}} \mathrm{CR}(p, P) = \min\left\{ \frac{\inf_P P(X\ge p)}{\sup_P P(X\ge p)},~ \frac{p}{\sup_P \mathbb{E}[X\,|\,X\ge p]} \right\}$$

This reduces analysis to three subproblems: bounds on tail probabilities and conditional expectations.

3. Characterization and Computation of Extremal Distributions

Worst-case distributions for DRCR are always two- or three-point laws, stemming from convexity and constraints in ambiguity sets.

• Two-point extremal: For $p\in(0,\beta]$, solve for $\alpha(p)>\mu$ in

$$\varphi(\alpha) \frac{\mu-p}{\alpha-p} + \varphi(p) \frac{\alpha-\mu}{\alpha-p} = s$$

The two-point law $P_2^*(p)$ has mass at $p$ and $\alpha(p)$ chosen to match the moments.

• Three-point extremal: The three-point law $P_3^*(p)$ is supported on $\{0,p,\beta\}$ with weights solving the three-moment equations.
• Tail-probability structure: For thresholds $\tau_1$ and $\tau_2$,

$$\begin{array}{ll} \sup_P P(X\ge p)= \begin{cases} 1, & p \le \tau_1 \ P_3^*(p)\{X\ge p\}, & \tau_1 \leq p \leq \tau_2 \ P_2^*(p)\{X\ge p\}, & p \geq \tau_2 \ \end{cases} \ \inf_P P(X\ge p)= \begin{cases} P_2^*(p)\{X\ge p\}, & p \le \tau_1 \ P_3^*(p)\{X\ge p\}, & \tau_1 \leq p \leq \tau_2 \ 0, & p \geq \tau_2 \ \end{cases} \end{array}$$

(Eck et al., 8 Sep 2025).

A key structural property is that the worst-case distribution for DRCR is the same as that for the revenue objective; only the maximization step changes between objectives.

4. Influence of Problem Parameters and Phase Structure

The DRCR depends on dispersion, support size, and prediction accuracy.

• As distributional dispersion (e.g., variance or fractional moment) increases, the low-price maximizer $p_l^*$ decreases and the high-price maximizer $p_h^*$ increases.
• There exists a critical threshold in dispersion ($\sigma^*$ for the variance case) marking a phase transition: below this, robust low pricing dominates; above it, a high-price “niche” strategy becomes optimal.
• With unbounded support ($\beta\to\infty$), the DRCR for pricing with high dispersion collapses to zero, indicating the necessity of a support cap for meaningful robustness guarantees.
• In the DRCR of online algorithms with predictions, performance gains from improved prediction accuracy exhibit diminishing returns: improvements are most rapid for small values of accuracy, then plateau as $\alpha\to 1$ (Yoshinaga et al., 11 Jan 2026).

5. Methodologies and Proof Techniques

DRCR analysis leverages several advanced techniques:

• Semi-infinite linear programming: Used to analyze optimization over measures in min–max formulations.
• Moment problems and extremal measure theory: Convexity and moment constraints guarantee that extremal laws are two- or three-point measures.
• Primal–dual formulations: These allow explicit calculation of worst-case guarantees.
• Avoidance of Charnes–Cooper transformation: Decomposition of the minimax DRCR objective enables separate handling of the numerator and denominator in ratio-based objectives.
• Finite LP reduction for online decision problems: In the ski rental problem, the optimal DRCR with interval predictions reduces to a finite-dimensional linear program with $O(B+n)$ variables and constraints (Yoshinaga et al., 11 Jan 2026).

A surprising result is that for many objectives, the adversarial law that minimizes DRCR is identical to that for expected revenue; the difference is only in the decision-maker’s choice of action (Eck et al., 8 Sep 2025).

6. Practical Computation and Applications

In deterministic monopoly pricing, practical computation proceeds via:

• Calculating two candidate prices ($p_l^*$ and $p_h^*$ in the variance case, or four in the fractional-moment case), and choosing the one yielding the highest worst-case competitive ratio.
• Implementing closed-form decision rules, e.g., for low variance, the low-price formula:

$$p_l^* = \mu-\sigma\left(\left(\frac{\mu}{2\sigma}+\sqrt{\frac{8}{27}+\left(\frac{\mu}{2\sigma}\right)^2}\right)^{1/3}+\left(\frac{\mu}{2\sigma}-\sqrt{\frac{8}{27}+\left(\frac{\mu}{2\sigma}\right)^2}\right)^{1/3}\right)$$

and for high variance, the high-price formula involving $\beta$ and $\tau_2$.

In online prediction-augmented algorithms (e.g., ski rental):

• The DRCR can be computed in closed form in the single-interval case and in polynomial time for general hierarchical predictions.
• The critical prediction accuracy needed to guarantee a target DRCR can be obtained by solving a two-line equation or via binary search in the accuracy parameter, solving the associated LP at each step (Yoshinaga et al., 11 Jan 2026).

The DRCR framework provides actionable procedures for robust decision-making in the presence of partial distributional knowledge or imperfect predictions. It unifies worst-case analysis, robust optimization, and the value of auxiliary information within a formal, tractable, and interpretable structure.

7. Extensions and Research Directions

The DRCR concept extends naturally to:

• Multi-prediction settings: DRCR remains concave and nonincreasing when multiple, nested prediction sets and associated accuracy levels are specified. For any collection of predictions $(\bm{\Theta},\bm{\alpha})$, the optimal DRCR is a concave function of the accuracy vector (Yoshinaga et al., 11 Jan 2026).
• General ambiguity sets: In pricing and related problems, DRCR admits generalization to nonstandard moment constraints, alternative dispersion measures, and more complex information structures.
• Computational tractability: For many classical online and mechanism design problems, the DRCR optimal strategy is efficiently computable via (possibly finite) LPs, provided the classical competitive ratio admits such a characterization.
• Benchmarking and calibration: DRCR enables principled comparison of algorithms, pricing mechanisms, and prediction-augmented heuristics under a unified worst-case calibrated framework.

A plausible implication is that the DRCR framework is positioned as a standard for analyzing robustness of online and information-limited optimization in presence of partial predictions, blending adversarial and stochastic paradigms seamlessly (Eck et al., 8 Sep 2025, Yoshinaga et al., 11 Jan 2026).