Skip to main navigation Skip to search Skip to main content

Competitive algorithms for online leasing problem in probabilistic environments

  • Xi'an Jiaotong University

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

16 Scopus citations

Abstract

We integrate probability distribution into pure competitive analysis to improve the performance measure of competitive analysis, since input sequences of the leasing problem have simple structure and favorably statistical property. Let input structures be the characteristic of geometric distribution, and we obtain optimal on-line algorithms and their competitive ratios. Moreover, the introducing of interest rate would diminish the uncertainty involved in the process of decision making and put off the optimal purchasing date.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsFuliang Yin, Chengan Guo, Jun Wang
PublisherSpringer Verlag
Pages725-730
Number of pages6
ISBN (Print)3540228438, 9783540228431
DOIs
StatePublished - 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3174
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Competitive algorithms for online leasing problem in probabilistic environments'. Together they form a unique fingerprint.

Cite this