On the public citation graph

Competitive Analysis for Online Leasing Problem with Compound Interest Rate

https://doi.org/10.1155/2011/156254
0 signed · 18 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-68535-9_10openalex-snapshot
On the Bahncard Problem
inferredcites →https://doi.org/10.1007/bf01189993openalex-snapshot
Competitive randomized algorithms for nonuniform problems
inferredcites →https://doi.org/10.1007/bf01294260openalex-snapshot
On the power of randomization in on-line algorithms
inferredcites →https://doi.org/10.1007/bf01762111openalex-snapshot
Competitive snoopy caching
inferredcites →https://doi.org/10.1007/bfb0029577openalex-snapshot
On the performance of competitive algorithms in practice
inferredcites →https://doi.org/10.1007/pl00009279openalex-snapshot
Competitive Optimal On-Line Leasing
inferredcites →https://doi.org/10.1007/pl00009285openalex-snapshot
A Risk‐Reward Framework for the Competitive Analysis of Financial Games
inferredcites →https://doi.org/10.1007/s00453-003-1013-xopenalex-snapshot
Dynamic TCP Acknowledgment and Other Stories about e/(e - 1)
inferredcites →https://doi.org/10.1007/s10898-006-9079-zopenalex-snapshot
On the on-line rent-or-buy problem in probabilistic environments
inferredcites →https://doi.org/10.1111/j.1467-9965.1991.tb00002.xopenalex-snapshot
Universal Portfolios
inferredcites →https://doi.org/10.1145/274440.274442openalex-snapshot
Competitive solutions for online financial problems
inferredcites →https://doi.org/10.1145/2786.2793openalex-snapshot
Amortized efficiency of list update and paging rules
inferredcites →https://doi.org/10.1287/moor.22.4.814openalex-snapshot
Nearly Optimal Competitive Online Replacement Policies

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4087144openalex-extracted
Risk-Reward Models for Two-Option Online Leasing Problem Under Sharing Economy
inferred← citeshttps://doi.org/10.1007/s10878-022-00855-0openalex-snapshot
Competitive analysis for two-option online leasing problem under sharing economy
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.04.006openalex-snapshot
Optimal randomized algorithm for a generalized ski-rental with interest rate
inferred← citeshttps://doi.org/10.1016/j.ipl.2020.105981openalex-snapshot
Online leasing strategy for depreciable equipment considering opportunity cost
inferred← citeshttps://doi.org/10.1145/3695652.3695653openalex-snapshot
Risk-Reward Models for Two-option Online Leasing Problem
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.