Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.05580

A Primal-Dual Approach to Randomized Online Bidding with Tail Constraints

Royce Kraakman·Bob Krekelberg·Alison Hsiang-Hsuan Liu·Fu-Hong Liu
View original source ↗Read source document ↗Export metadata ↓

Abstract

Controlling tail risk in randomized algorithms has received increasing attention. A recently introduced approach is to impose tail constraints that limit the probability of poor outcomes. We study the randomized online bidding problem under such tail constraints. When the tail constraints require zero probability of exceeding the prescribed thresholds, we determine the optimal expected competitive ratio. For general tail constraints that allow positive exceedance probabilities, we derive a parameter-dependent upper bound on the optimal expected competitive ratio. This work builds on the Master's thesis of Royce Kraakman, which initiated our study of tail constraints for online bidding. The optimality result established in the present paper, in particular the matching lower bound for pure tail constraints, was obtained subsequently and is not contained in the thesis. After becoming aware of independent related work by Basiak et al. on pure tail constraints, we decided to make this preliminary version publicly available while the manuscript is still under development. Some material from the thesis has not yet been incorporated into the present version.

Explore related subjects

cs.DM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Royce Kraakman, Bob Krekelberg, Alison Hsiang-Hsuan Liu, Fu-Hong Liu. 2026-10-04. A Primal-Dual Approach to Randomized Online Bidding with Tail Constraints. https://arxiv.org/abs/2610.05580

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

KEEP EXPLORING

Related papers

arXiv2026

A Boolean encoding of the Most Permissive semantics for Boolean networks

Boolean networks are widely used to model biological regulatory networks and study their dynamics. Classical semantics, such as the asynchronous semantics, do not always accurately capture transient or asymptotic behaviors observed in quantitative models. To address this limitation, the Most Permissive semantics was introduced by Paulevé et al., extending Boolean dynamics with intermediate activity levels that allow components to transiently activate or inhibit their targets during transitions. In this work, we provide a Boolean encoding of the Most Permissive semantics: each component of the original network is represented by a triplet of Boolean variables, and we derive the extended logical function governing the resulting network. We prove that the asynchronous dynamics of the encoded network exactly reproduces the attainability properties of the original network under Most Permissive semantics. This encoding is implemented as a modifier within the bioLQM framework, making it directly compatible with existing tools such as GINsim. To address scalability limitations, we further extend the tool to support partial unfolding, restricted to a user-defined subset of components.

cs.DM↗
arXiv2026

Analyzing Network Robustness via Residual Closeness

Networks are inherently vulnerable to vertex failures, making the analysis of their structural robustness a fundamental problem in graph theory. In this study, we investigate the closeness and vertex residual closeness of graphs, with a particular focus on the middle graph representations of certain special graph classes, which provide a richer structural framework for analysis. We derive exact expressions for the closeness values of these middle graphs and determine their residual closeness under vertex failures. By utilizing results obtained from specific graph families, we establish several general bounds for broader graph classes. Furthermore, by exploiting the relationship between the closeness of a graph, its line graphs and middle graphs, we obtain new results that relate these three structures. In addition, we present a computational procedure for evaluating closeness and vertex residual closeness in middle graphs, together with numerical verification of selected theoretical results and an analysis of its computational complexity.

cs.DM↗
arXiv2026

Hull Games of Induced Path Convexities in Graphs

In 1984, Frank Harary introduced the first convexity games in graphs, all of them based on the geodesic convexity, which is the graph convexity related to shortest paths. In 2024, Araújo et al. obtained the first PSPACE-hardness proofs on some of these geodesic games and generalized them to any graph convexity. In this paper, we investigate convexity games on several known induced path convexities: the monophonic $\mathrm{m}$-convexity and the $\ell_k$-convexities, based on induced paths and on induced paths of size at most $k$. We prove that the hull games $\mathrm{CHG}_{\mathrm{m}}$, $\mathrm{CHG}_{\ell_k}$ and their misère variants are PSPACE-complete for every $k\ge2$ even in graphs with diameter at most 3. We also use the Sprague-Grundy Theory to obtain a polynomial time algorithm to decide the winner of the games $\mathrm{CHG}_{\mathrm{m}}$ and $\mathrm{CHG}_{\ell_k}$ for any $k\ge2$ in disjoint unions of paths and cycles. For $k\ge3$ odd, we prove that Alice (1st player) wins $\mathrm{CHG}_{\ell_k}$ in the path $P_n$ if and only if $n$ is odd and she wins in the cycle $C_n$ if and only if $n=3$ or $n=α\cdot (k+1)-1$ with $α\ge2$. For $k\ge2$ even, the only periodic nimber sequences of $\mathrm{CHG}_{\ell_k}$ obtained through extensive computational testing occurred for $k=2^h-4$ with $h\ge3$, e.g, $k\in\{4,12,28,60,\ldots\}$. In this case ($k=2^h-4$ with $h\ge3$), we prove that the nimber sequences of $\mathrm{CHG}_{\ell_k}$ in $P_n$ and in $C_n$ are periodic and Alice loses (resp. wins) in $P_n$ (resp. $C_n$) with $n>k$ only when $n=3k+4$ (resp. $n\in\{2k+1,5k+3\}$). Finally, we show that, for $k=2$, the game $\mathrm{CHG}_{\ell_2}$ in paths $P_n$ is closely related to the classical game \emph{Couples-are-Forever} of J. H. Conway: it is still an open problem if the nimber sequence is periodic or not and Alice loses only for 12 values of $n$ up to $50$ million.

cs.DM↗