Online Financial Algorithms Competitive Analysis

Analysis of algorithms with complete knowledge of its inputs is sometimes not up to our expectations. Many times we are surrounded with such scenarios where inputs are generated without any prior knowledge. Online Algorithms have found their applicability in broad areas of computer engineering. Among these, an online financial algorithm is one of the most important areas where lots of efforts have been used to produce an efficient algorithm. In this paper various Online Algorithms have been reviewed for their efficiency and various alternative measures have been explored for analysis purposes.

• Publication year

  2012

• Venue

  arXiv.org

• Publication date

  2012-02-29

• Fields of study

  Computer Science

• Identifiers
  DOI 10.5120/4974-7228arXiv 1209.6489
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• International Journal of Computer and Applications

  2010cited by this paper
• Switching investments

  2010cited by this paper
• Competitive Analysis of Online Price Discount Replacement Problem

  2009cited by this paper
• Ski rental with two general options

  2008cited by this paper
• Empirical Analysis of an Online Algorithm for Multiple Trading Problems

  2008cited by this paper
• Optimal Algorithms for k-Search with Application in Option Pricing

  2007cited by this paper
• Optimal Algorithms for k -Search with Application in Option Pricing

  2007cited by this paper
• Online pricing for web service providers

  2006cited by this paper
• Online trading algorithms and robust option pricing

  2006influential reference
• Near-optimal online auctions

  2005cited by this paper
• On the Competitive Theory and Practice of Portfolio Selection

  2002cited by this paper
• Average-Case Competitive Analyses for Ski-Rental Problems

  2002influential reference
• Online algorithms for market clearing

  2002cited by this paper
• Incentive-compatible online auctions for digital goods

  2002cited by this paper
• Seller-Focused Algorithms for Online Auctioning

  2001cited by this paper
• Optimal Search and One-Way Trading Online Algorithms

  2001cited by this paper
• An axiomatic treatment of three qualitative decision criteria

  2000cited by this paper
• Competitive solutions for online financial problems

  1998cited by this paper
• On‐Line Portfolio Selection Using Multiplicative Updates

  1998cited by this paper
• Developments from a June 1996 seminar on Online algorithms: the state of the art

  1998cited by this paper
• On the Bahncard problem

  1998cited by this paper
• The competitive analysis of risk taking with applications to online trading

  1997cited by this paper
• Competitive Analysis of Algorithms

  1996cited by this paper
• Competitive analysis of financial games

  1992cited by this paper
• Amortized efficiency of list update and paging rules

  1985cited by this paper

• in Computer

  year unknowncites this paper