arXiv (All)
open access
Pure Tail Constraints for Online Problems
Controlling tail risk is an important objective in online optimization, and recently it has been studied in the context of competitive analysis. Continuing this line of research, we investigate pure tail constraints, which capture the tradeoff between expected and worst-case competitiveness. For two
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Nearly Tight Lower Bound for Matroid Intersection Prophet Inequalities#1034496
- Quota Mechanisms: Finite-Sample Optimality and Robustness#128265
- Risky Loss Distributions And Modeling the Loss Reserve Pay-out Tail#259267
- Simple “Market Value” Bargaining Model for Weighted Voting Games: Characterization and Limit Theorems#942107
- The Price of Privacy For Approximating Max-CSP#1109784
Record · ID 1129929
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive