On Capital Investment
The DOI matches its Crossref record; 5 of the 6 references it cites were found in a registry or an index.
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
“Augustine at el. [2] define a general non-additive model in which a transition cost b ij is associated with every two states i and j , and show that one may assume w.l.o.g. that b ij = 0 if i > j and that b ij ≤ b j for every i < j .”
From Rent, Lease, or Buy: Randomized Algorithms for Multislope Ski Rental (2012) · cites this paper as [2]
Citations
Cites
Amortized efficiency of list update and paging rules
Sleator, D. D., & Tarjan, R. E. (1985) · Communications of the ACM · doi:10.1145/2786.2793 · Cited by 2,123
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
Competitive analysis of financial games
El‐Yaniv, R., Fiat, A., Karp, R. M., & Turpin, G. (1992) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1992.267758 · Cited by 88
Self-citationA statistical adversary for on-line algorithms
Raghavan, P. (1992) · DIMACS series in discrete mathematics and theoretical computer science · doi:10.1090/dimacs/007/05 · Cited by 58
El‐Yaniv, R., & Karp, R. M. (2002) · Israel Symposium on Theory and Computing Systems (ISTCS) · doi:10.1109/istcs.1993.253458 · Cited by 10
Cited by
Bakker, H., Dunke, F., & Nickel, S. (2019) · Omega · doi:10.1016/j.omega.2019.06.006 · Cited by 136
Augustine, J. E., Irani, S., & Swamy, C. (2004) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2004.50 · Cited by 90
Augustine, J. E., Irani, S., & Swamy, C. (2008) · SIAM Journal on Computing · doi:10.1137/05063787x · Cited by 74
Rent, Lease, or Buy: Randomized Algorithms for Multislope Ski Rental
Lotker, Z., Patt-Shamir, B., & Rawitz, D. (2012) · SIAM Journal on Discrete Mathematics · doi:10.1137/100794018 · Cited by 39
Rent, Lease or Buy: Randomized Algorithms for Multislope Ski RentalPreprint
Lotker, Z., Patt-Shamir, B., & Rawitz, D. (2008) · arXiv (Cornell University) · Cited by 37
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
On the on-line rent-or-buy problem in probabilistic environments
Xu, Y., Xu, W., & Li, H. (2006) · Journal of Global Optimization · doi:10.1007/s10898-006-9079-z · Cited by 26
The ski-rental problem with multiple discount options
Zhang, G., Poon, C. K., & Xu, Y. (2011) · Information Processing Letters · doi:10.1016/j.ipl.2011.06.012 · Cited by 24
Nearly optimal strategies for special cases of on-line capital investment
Damaschke, P. (2003) · Theoretical Computer Science · doi:10.1016/s0304-3975(02)00727-2 · Cited by 22
Dynamic session management for static and mobile users: a competitive on-line algorithmic approach
Bejerano, Y., Cidon, I., & Naor, J. (. (2000) · Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications · doi:10.1145/345848.345864 · Cited by 19
On Energy Conservation in Data Centers
Albers, S. (2017) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/3087556.3087560 · Cited by 20
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
Competitive strategy for on-line leasing of depreciable equipment
Zhang, Y., Zhang, W.-G., Xu, W., & Li, H. (2011) · Mathematical and Computer Modelling · doi:10.1016/j.mcm.2011.02.036 · Cited by 16
On Energy Conservation in Data Centers
Albers, S. (2019) · ACM Transactions on Parallel Computing · doi:10.1145/3364210 · 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
Engineering Time-Dependent Many-to-Many Shortest Paths Computation
Geisberger, R., & Sanders, P. (2010) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/oasics.atmos.2010.74 · Cited by 11
Online leasing problem with price fluctuations and the second-hand transaction
Feng, X., & Chu, C. (2020) · Journal of Combinatorial Optimization · doi:10.1007/s10878-020-00640-x · Cited by 9
AN ASSET VALUE EVALUATION FOR DOCKING FINANCE LEASE PROBLEMS IN THE PEER-TO-PEER PLATFORM
Qu, J., Liu, H., Zhu, H., & Gao, H. (2020) · Journal of Business Economics and Management · doi:10.3846/jbem.2020.13380 · Cited by 8
New Results on Online Replacement Problem
Xu, Y., Xin, C., & Yi, F. (2005) · Lecture notes in computer science · doi:10.1007/11600930_55 · Cited by 8
A Better bound of randomized algorithms for the multislope ski-rental problem
Hu, M., & Xu, W. (2017) · RAIRO - Theoretical Informatics and Applications · doi:10.1051/ita/2017009 · Cited by 9
Feng, X., Zhang, B., & Dai, Y. (2019) · IEEE Access · doi:10.1109/access.2019.2918693 · Cited by 6
A New Approach to Capacity Scaling Augmented with Unreliable Machine Learning Predictions
Rutten, D., & Mukherjee, D. (2023) · Mathematics of Operations Research · doi:10.1287/moor.2023.1364 · Cited by 5
On the remote server problem or more about TCP acknowledgments
Epstein, L., & Kesselman, A. (2006) · Theoretical Computer Science · doi:10.1016/j.tcs.2006.09.003 · Cited by 5
Risk Management for Online Simplified Bahncard Problem
Xin, C., Cui, W., & Ma, W.-M. (2006) · International Conference on Machine Learning and Cybernetics · doi:10.1109/icmlc.2006.258441 · Cited by 6
Online Leasing Problem with Price Fluctuations and Second-hand Transaction
Feng, X., Chu, F., Dai, Y., Huang, L., & Chen, N. (2019) · International Conference on Industrial Engineering and Systems Management · doi:10.1109/iesm45758.2019.8948103 · Cited by 4
Patt-Shamir, B., & Yadai, E. (2020) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/3350755.3400280 · Cited by 6
Zhang, Y., Li, J., Yang, X., & Wang, X. (2022) · Journal of Combinatorial Optimization · doi:10.1007/s10878-022-00886-7 · Cited by 4
Randomized Strategies for Non-additive 3-Slope Ski Rental
Böhnlein, T., Erlich, S., Lotker, Z., & Rawitz, D. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-09993-9_4 · Cited by 3
Competitive Analysis of the Online Leasing Problem for Scarce Resources
Lu, J., Chen, N., & Feng, X. (2023) · International Journal of Environmental Research and Public Health · doi:10.3390/ijerph20010886 · Cited by 3
Competitive Analysis of Two Special Online Device Replacement Problems
Xin, C., Ma, W., & Yang, L. (2008) · Journal of Computer Science and Technology · doi:10.1007/s11390-008-9122-2 · Cited by 4
Bin, L., Peiji, S., & Liu, D. (2007) · International Symposium on Data, Privacy, and E-Commerce · doi:10.1109/isdpe.2007.94 · Cited by 4
Caching Content under Digital Rights Management
Epstein, L., Fiat, A., & Levy, M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-540-93980-1_15 · Cited by 2
Self-citationOnline multi-instance acquisition for cost optimization in IaaS Clouds
Alouane, N.-E., Abouchabaka, J., & Rafalia, N. (2016) · International Conference on Cloud Computing Technologies and Applications (CloudTech) · doi:10.1109/cloudtech.2016.7847711 · Cited by 1
On Two Special Cases of Online Device Replacement Problem
Xin, C., Ma, W., & Yang, L. (2007) · International Symposium on Data, Privacy, and E-Commerce · doi:10.1109/isdpe.2007.52 · Cited by 1
The Online Specialization Problem
Hong, E. S. (2006) · Discrete Mathematics & Theoretical Computer Science · doi:10.46298/dmtcs.359
Rent or Buy Problems with a Fixed Time Horizon
Epstein, L., & Zebedat-Haider, H. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40313-2_33
Online Algorithms for Convex Case Capital Investment
Itoh, T. (2002) · Interdisciplinary Information Sciences · doi:10.4036/iis.2002.77
Long-term projecting in the local or territorial automation systems with alternative network models
Потудинский, А. В., Власов, А., & Лысов, Д. (2020) · IOP Conference Series Materials Science and Engineering · doi:10.1088/1757-899x/862/4/042044
Patt-Shamir, B., & Yadai, E. (2023) · Theory of Computing Systems · doi:10.1007/s00224-023-10126-y
Metadata
- Authors
- Azar, Y., Bartal, Y., Feuerstein, E., Fiat, A., Leonardi, S., & Rosén, A.
- Affiliations
- Tel Aviv University (IL)
- International Computer Science Institute (US)
- Universidad de Buenos Aires (AR)
- Sapienza University of Rome (IT)
- University of Toronto (CA)
- Venue
- Algorithmica
- Published
- 1999-05
- Volume
- 25
- Issue
- 1
- Pages
- 22-36
- ISSN
- 0178-4617 (ISSN-L)
- OpenAlex
- W2035051184
- Cited by
- 40
- References
- 6
- Citations by year
- 2023: 3 · 2022: 2 · 2020: 4 · 2019: 4 · 2018: 1 · 2017: 2 · 2016: 1 · 2015: 1 · 2014: 2 · 2013: 1 · 2012: 1
- FWCI
- 1.12
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Algorithmica (publishedVersion)
- Topics
- Physical Sciences › Mathematics › Theoretical Computer Science › Optimization and Search Problems
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Keywords
- capital investment, ski rental problem, online algorithms, competitive ratio, production cost minimization, machine replacement, lower bounds, unknown demand, investment opportunities
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
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.