The ski-rental problem with multiple discount options
The DOI matches its Crossref record; 14 of the 15 references it cites were found in a registry or an index, and 1 are not checked yet.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“We note that the difference from Anand et al.'s algorithm (2021) is the fact that we append b (SOL i -1 ) instead of b (2 OPT( τ i -1 )) at each iteration i , as is inspired by Zhang et al. (2011).”
From Improved Learning-Augmented Algorithms for the Multi-Option Ski Rental Problem via Best-Possible Competitive Analysis (2023) · cites this paper as Zhang et al., 2011
In the citing paper
“Although Zhang et al. (2011) already gives the same lower bound of 4”
From Improved Learning-Augmented Algorithms for the Multi-Option Ski Rental Problem via Best-Possible Competitive Analysis (2023) · cites this paper as Zhang et al., 2011
In the citing paper
“Indeed, Zhang et al. (2011) provided the same lower bound on the competitive ratio of deterministic algorithms”
From Improved Learning-Augmented Algorithms for the Multi-Option Ski Rental Problem via Best-Possible Competitive Analysis (2023) · cites this paper as Zhang et al., 2011
Citations
Cites
Algorithmic problems in power management
Irani, S., & Pruhs, K. R. (2005) · ACM SIGACT News · doi:10.1145/1067309.1067324 · Cited by 303
On-line algorithms versus off-line algorithms: How much is it worth to know the future?
Karp, R. M. (1993) · Mathematical Social Sciences · doi:10.1016/0165-4896(93)90040-p · Cited by 143
Fleischer, R. (2001) · Theoretical Computer Science · doi:10.1016/s0304-3975(00)00266-8 · Cited by 97
Fleischer, R. (1998) · Lecture notes in computer science · doi:10.1007/3-540-68535-9_10 · Cited by 95
Meyerson, A. (2005) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2005.72 · Cited by 81
A Risk‐Reward Framework for the Competitive Analysis of Financial Games
Al-Binali, S. A.-S. (1999) · Algorithmica · doi:10.1007/pl00009285 · Cited by 69
Competitive Optimal On-Line Leasing
El‐Yaniv, R., Kaniel, R., & Linial, N. (1999) · Algorithmica · doi:10.1007/pl00009279 · Cited by 68
Average-Case Competitive Analyses for Ski-Rental Problems
Fujiwara, H., & Iwama, K. (2005) · Algorithmica · doi:10.1007/s00453-004-1142-x · Cited by 51
Ski rental with two general options
Lotker, Z., Patt-Shamir, B., & Rawitz, D. (2008) · Information Processing Letters · doi:10.1016/j.ipl.2008.07.009 · Cited by 43
Azar, Y., Bartal, Y., Feuerstein, E., Fiat, A., Leonardi, S., & Rosén, A. (1999) · Algorithmica · doi:10.1007/pl00009281 · Cited by 40
Cited by
Competitive analysis of the online financial lease problem
Dai, W., Dong, Y., & Zhang, X. (2015) · European Journal of Operational Research · doi:10.1016/j.ejor.2015.10.020 · Cited by 30
Online Lower Bounds via Duality
Azar, Y., Cohen, I. R., & Roytman, A. (2017) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611974782.66 · Cited by 18
Rent or Buy Problems with a Fixed Time Horizon
Epstein, L., & Zebedat-Haider, H. (2014) · Theory of Computing Systems · doi:10.1007/s00224-014-9552-x · Cited by 18
Online leasing strategy for depreciable equipment considering opportunity cost
Zhang, Y., Xian, J., & Huang, M. (2020) · Information Processing Letters · doi:10.1016/j.ipl.2020.105981 · Cited by 15
Online leasing problem with price fluctuations under the consumer price index
Feng, X., Xu, Y., Ni, G., & Dai, Y. (2018) · Journal of Combinatorial Optimization · doi:10.1007/s10878-018-0305-7 · Cited by 14
Self-citation
Metadata
- Authors
- Zhang, G., Poon, C. K., & Xu, Y.
- Affiliations
- Xi'an Jiaotong University (CN)
- City University of Hong Kong (HK)
- Corresponding author
- Poon, Chung Keung
- Venue
- Information Processing Letters
- Publisher
- Elsevier BV
- Published
- 2011-09
- Volume
- 111
- Issue
- 18
- Pages
- 903-906
- ISSN
- 0020-0190 (ISSN-L)
- OpenAlex
- W1989785453
- Cited by
- 24
- References
- 14
- Citations by year
- 2026: 1 · 2025: 2 · 2023: 2 · 2022: 4 · 2021: 1 · 2020: 2 · 2019: 2 · 2018: 2 · 2017: 1 · 2016: 2 · 2015: 2 · 2014: 2 · 2013: 1
- FWCI
- 1.26
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- Locations
- Information Processing Letters (publishedVersion)
- Topics
- Physical Sciences › Mathematics › Theoretical Computer Science › Optimization and Search Problems
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Keywords
- ski rental problem, online algorithms, competitive ratio, lower bounds, deterministic algorithms, online decision making
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The ski-rental problem with multiple discount options. https://app.cochat.ai/papers/10.1016/j.ipl.2011.06.012
- The paper
- Zhang, G., Poon, C. K., & Xu, Y. (2011). The ski-rental problem with multiple discount options. Information Processing Letters. https://doi.org/10.1016/j.ipl.2011.06.012
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.