Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.19016

Secretary Problems with Interactive Ordinal Queries

José A. Soto·Felipe Valdevenito
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study secretary problems in which the online algorithm can ask a reliable oracle a limited number of ordinal queries about unseen elements. Values are revealed only when elements arrive, and all accept/reject decisions are irrevocable. The oracle never reveals numerical values; it only answers questions defined relative to the information already observed by the algorithm. We first consider the single-choice secretary problem. A query returns the number of unseen elements whose value exceeds the current record. We analyze random order, adversarial order, and two sample-based adversarial orders, with no queries, one query, and unlimited queries. We obtain tight bounds for all variants except one. In adversarial order, queries do not improve over the trivial $1/n$ guarantee. In random order, one query improves the optimal success probability from $1/e$ to $0.4477\ldots$, and unlimited queries achieve the optimal value $1/2$. In the sample-based models, one query already yields the tight value $1/e$ against an online adversary, while unlimited queries give the exact value $(20\sqrt{10}-29)/81$ against an offline adversary. The remaining one-query offline-adversarial case is left open, and we give two partial upper bounds for it. We also extend the model to the matroid secretary problem, where we study two ordinal query interfaces. A simple query identifies the unseen elements that would individually improve the current optimum on the observed set, while a complete query gives a finer ordinal partition of the unseen elements by weight relative to that optimum. Under sample-based online adversarial order, a single simple query yields a $1/4$ probability-competitive algorithm, and a complete query improves this to the optimal $1/e$. Finally, with unlimited complete queries in the random-order model, we achieve the optimal $1/2$ probability-competitive ratio.

Explore related subjects

cs.DS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

José A. Soto, Felipe Valdevenito. 2026-07-20. Secretary Problems with Interactive Ordinal Queries. https://arxiv.org/abs/2609.19016

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Online Flexible Busy Time Scheduling on Heterogeneous Machines

We study the online busy time scheduling model on heterogeneous machines. In our setting, jobs with uniform processing time arrive online with a deadline that becomes known to the algorithm at the job's arrival time. An algorithm has access to machines, each with different associated capacities and costs. The goal is to schedule jobs on machines by their deadline, so that the total cost incurred by the scheduling algorithm is minimized. While busy time scheduling has been well-studied, relatively little is known when machines are heterogeneous (i.e., have different costs and capacities), despite this natural theoretical generalization being the most practical model for clients using cloud computing services. We make significant progress in understanding this model by designing a deterministic online algorithm with competitive ratio 8(2p-1)/p < 16 when all jobs have uniform processing time p. A randomized version of this algorithm is 4(2p-1)/(p \ln 2)-competitive against an oblivious adversary. For unit-processing-time jobs, we give lower bounds of 4 and e (where e is Euler's number) on the competitive ratio of deterministic and randomized online algorithms, respectively. For unit-processing-time jobs with agreeable deadlines, we provide a deterministic 2-competitive online algorithm and a matching lower bound.

cs.DS↗
arXiv2026

The Semi-Oblivious Cup Game: an Imperfect Information Setting

In the cup game, an adversary distributes $1$ unit of water among $n$ initially empty cups during each time step. The player then selects a single cup from which to remove up to $1$ unit of water, with the goal of minimizing the backlog, i.e., the supremum of the height of the fullest cup over all time steps. In the cup flushing game, the player is additionally allowed to empty the chosen cup entirely. Past work has shown that the optimal backlog in both of these settings is $Θ(\log n)$. Furthermore, the \textbf{greedy} algorithm, which always removes water from the fullest cup, has been shown in previous work to be exactly optimal in both the cup game and the cup flushing game. We introduce a new model, the semi-oblivious cup game, in which the player is uncertain of the exact height of each cup. We analyze the performance of the \textbf{greedy} algorithm in this setting, which can be viewed as selecting an arbitrary cup within a constant multiplicative factor of the fullest cup. We prove matching upper and lower bounds showing that the \textbf{greedy} algorithm achieves a backlog of $Θ(n^{\frac{c-1}{c}})$ in the semi-oblivious cup game. We also establish matching upper and lower bounds of $2^{Θ(\sqrt{\log n})}$ in the semi-oblivious cup flushing game. Finally, we show that in an additive error setting, greedy is actually able to achieve backlog $Θ(\log n)$, via matching upper and lower bounds. All of our lower bounds apply for adaptive adversaries against any (even randomized) algorithm, proving that greedy is asymptotically optimal in the semi-oblivious model.

cs.DS↗
arXiv2026

The Binary Tree Mechanism is Optimal for Differentially Private Continual Counting

Private continual counting is a fundamental problem in differential privacy: given a binary stream of length $n$, where each $1$ corresponds to the contribution of one individual, the goal is to release all running counts while protecting the privacy of each individual. For fixed privacy parameters, the standard binary tree mechanism achieves expected $\ell_\infty$ error $O(\log^{3/2} n)$ under approximate differential privacy and $O(\log^2 n)$ under pure differential privacy. Whether these dependences on the stream length are necessary has remained a central open problem. For fixed $\varepsilon\in(0,1)$, we prove a lower bound of $Ω(\log^{3/2} n)$ under approximate DP with sufficiently small fixed $δ>0$, and a lower bound of $Ω(\log^2 n)$ under pure DP. These bounds establish the optimality of the binary tree mechanism in both settings. The bounds hold for arbitrary mechanisms, even when the entire stream is available in advance. Both proofs use the same decomposition and accumulation of residual noise along a tree. As a consequence of the approximate-DP bound, we also obtain a largest-possible separation between hereditary discrepancy and private $\ell_\infty$ error for linear queries, showing that the known general upper bound in terms of hereditary discrepancy has the optimal dependence on the number of queries.

cs.DS↗