Jul 2025· Algorithmic Game Theory· 1 citation· 34 references
Computer ScienceMathematics
Abstract
We consider an optimal stopping problem with n correlated offers where the goal is to design a (randomised) stopping strategy that maximises the expected value of the offer at which we stop. Instead of assuming to know the complete correlation structure, which is unrealistic in practice, we only assume to have knowledge of the distribution of the maximum value Xmax of the sequence, and want to analyse the worst-case correlation structure whose maximum follows this distribution. This can be seen as a trade-off between the setting in which no distributional information is known, and the Bayesian setting in which the (possibly correlated) distributions of all the individual offers are known. As our first main result we show that a deterministic threshold strategy using the monopoly price of the distribution of the maximum value is asymptotically optimal assuming that the expectation of the maximum value grows sublinearly in n. In our second main result, we further tighten this bound by deriving a tight quadratic convergence guarantee for sufficiently smooth distributions of the maximum value. Our results also give rise to a more fine-grained picture regarding prophet inequalities with correlated values, for which distribution-free bounds only yield a performance guarantee of the order 1/n.
This study considers the problem of portfolio choice, where we recommend a portfolio to an investor to maximize the expected utility of their wealth. Our goal is to construct an asymptotically optimal portfolio choice rule in terms of expected utility regret, the difference between the expected utility of an oracle inv...
We study fundamental information-theoretic limits of robust stochastic optimization when the distribution is known only through its exact moment sequence. We develop a unified framework that produces families of distinct distributions sharing all moments yet inducing radically different optimal decisions, thereby estab...
We consider the problem of when it is best to sell a risky asset in the framework of the \textit{distribution builder} approach under the consideration of potential ruin. This approach allows investors to express their preferences directly as a desired target distribution without first specifying a risk aversion or uti...
Motivated by many application problems, we consider Markov decision processes (MDPs) with a general loss function and unknown parameters. To mitigate the epistemic uncertainty associated with unknown parameters, we take a Bayesian approach to estimate the parameters from data and impose a coherent risk functional (with...
Sample complexity is a widely used metric in sequential decision-making problems, defined as the number of suboptimal decisions during the interaction between the agent and an environment. We study the sample complexity of stochastic multi-armed bandit problems and introduce the expected sample complexity performance m...
We determine the exact worst-case function-value suboptimality after $N$ first-order oracle calls on $L$-smooth, $\mu$-strongly convex functions under a nonnegative weighted combination of the initial squared distance, function-value suboptimality, and squared gradient norm. Excluding the case where no strict improveme...
Yoel Drori· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.