Dissertation > Excellent graduate degree dissertation topics show

The Study of Competitive Decision-making Algorithm for Online Currency Trading

Author: ZhangRuiYing
Tutor: ZhangYuanPing
School: Lanzhou University of Technology
Course: Computer Software and Theory
Keywords: Time series Search Online trading algorithm Deterministic algorithm Randomness algorithm Competitive ratio
CLC: F830
Type: Master's thesis
Year: 2011
Downloads: 9
Quote: 0
Read: Download Dissertation

Abstract


Online problem and its competitive algorithm theory at home and abroad in recent years a hot research direction . Online study the problem of decision-making under incomplete information , and can not know and predict future exact information , it is often the problem can not be to make the best decisions , and can only try to give a satisfactory decision - making of the problem . Competitive algorithm is a decision-making, decision - making results in the decision-making algorithm under various conditions given the corresponding the offline optimal decision within a certain range . Online competitive algorithms and competitive than the proposal of the concept to make up for the lack of traditional optimization theory in processing online , has made ??a lot of research in computer science and a wide range of applications . In recent years, with the acceleration of the process of the globalization of trade and economic integration , and future financial and management issues , the lack of information and uncertainty , and now they are also increasingly affected by many online issues and competition algorithm researchers widespread concern. Online trading algorithm has an extremely important theoretical significance not only in the economic field , but also in economic management and the daily life of a wide range of applications , such as search for employees and work , stock investment , stock and insurance issues and so on . Reality typical online trading decisions , there are a variety of different models with deterministic or stochastic algorithm to solve . This article describes the basic model of the online trading issues and related deterministic and stochastic algorithms , randomness the decision algorithm RAKD ( Random Algorithm with Known Duration) based on the time sequence search model based on the introduction of the profit function analysis proved the worst algorithm the case competition than through experiments with deterministic algorithms performance comparison analysis and experimental results show that the algorithm can in some cases reduce the algorithm competition and a wider range of applications . In addition, for the worst case , the proposed algorithm improved randomness . Finally, a summary of this research work , and pointed out that the online trading algorithm further research in this field .

Related Dissertations

  1. Study on Deterministic Algorithms for Global Optimization Problem,O224
  2. The Scheduling with Rejection and Parallel-batching on Parallel Machines and on-line Scheduling with Parallel-batching on Two Uniform Machines,O223
  3. Some Scheduling Problem in Production Management,O223
  4. Scheduling in Group Technology and Online Supply Chain Problem,O223
  5. Online Serial-batch Scheduling and Off-line Mixed Batch Scheduling on a Single Machine,O223
  6. Scheduling on a Batch Processing System with Item-availability to Minimize Total Weighted Job Completion Time,O223
  7. Online-list Scheduling on a Bounded Batch Machine,O223
  8. On-line Scheduling on Batch Machines with Lookahead,O223
  9. Online Scheduling Problem with Delivery Times of Jobs,O223
  10. Workpiece may refuse the online scheduling problem of the two models,O223
  11. A Study of Preemptive Scheduling on Parallel Machines,O223
  12. Online Parallel Machine Scheduling Problems,O223
  13. Application of Cutting Plane Method in MINLP Problems,O221.2
  14. Olympic Sports Tactical analysis projects Research and Implementation of Knowledge,TP182
  15. Workpiece process optimization scheduling problem,O223
  16. Design and Analysis of Predictive Scheduling Algorithms for Minimizing Total Completion Time Problem,TP301.6
  17. A Study on On-line Scheduling with Reassignment,O223
  18. Special sort of parallel work,O223
  19. Identical Machine Scheduling Problems of Research,O223
  20. On-line Scheduling with Non-overlapping Maintenance Time on Parallel Machines,O223

CLC: > Economic > Fiscal, monetary > Finance, banking > Finance, banking theory
© 2012 www.DissertationTopic.Net  Mobile