Iftikhar Ahmad1,*, Abdulwahab Ali Almazroi2, Mohammed A. Alqarni3, Muhammad Kashif Nawaz1
Intelligent Automation & Soft Computing, Vol.31, No.2, pp. 1131-1142, 2022, DOI:10.32604/iasc.2022.020715
- 22 September 2021
Abstract In a classical k-min search problem, an online player wants to buy k units of an asset with the objective of minimizing the total buying cost. The problem setting allows the online player to view only a single price quotation at each time step. A price quotation is the price of one unit of an asset. After receiving the price quotation, the online player has to decide on the number of units to buy. The objective of the online player is to buy the required k units in a fixed length investment horizon. Online algorithms are proposed More >
Login
Register
