A Sharp Additive Bound for the Threshold Rule in Repeated Rent-or-Buy
cs.DS
Submitted: 2026-11-03
Updated: 2026-11-03
Terminology
Sources
- How Do AI Agents Spend Your Money? Analyzing and Predicting Token Consumption in Agentic Coding Tasks
- Self-GC: Self-Governing Context for Long-Horizon LLM Agents
- Simultaneous Competitive and Regret Guarantees for TCP Acknowledgment
- Don't Break the Cache: An Evaluation of Prompt Caching for Long-Horizon Agentic Tasks
- CliffCompaction: Cost-Efficient Compaction for Long-Horizon Coding Agents
- Token Reduction Is Not Cost Reduction
- CADOC: Cache-Aware Dynamic Object Context for Long-Horizon Agents
- AutoCompact: Learning When to Compact Context in Long-Horizon Coding Agents
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time