Competitive algorithms for online conversion problems with interrelated prices
The classical uni-directional conversion algorithms are based on the assumption that prices are arbitrarily chosen from the fixed price interval[m, M] where m and M represent the estimated lower and upper bounds of possible prices 0<m<M. The estimated interval is erroneous and no attempts are...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | en en en |
| Published: |
The Science and Information (SAI) Organization Limited
2019
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/74100/7/74100%20Competitive%20Algorithms%20for%20Online%20Conversion.pdf http://irep.iium.edu.my/74100/8/74100%20Competitive%20Algorithms%20for%20Online%20Conversion%20SCOPUS.pdf http://irep.iium.edu.my/74100/19/74100_Competitive%20Algorithms%20for%20Online%20Conversion%20_wos.pdf http://irep.iium.edu.my/74100/ https://thesai.org/Downloads/Volume10No6/Paper_75-Competitive_Algorithms_for_Online_Conversion_Problem.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1834515090568642560 |
|---|---|
| author | Iqbal, Javeria Ahmad, Iftikhar Shah, Asadullah |
| author_facet | Iqbal, Javeria Ahmad, Iftikhar Shah, Asadullah |
| author_sort | Iqbal, Javeria |
| building | IIUM Library |
| collection | Institutional Repository |
| content_provider | International Islamic University Malaysia |
| content_source | IIUM Repository (IREP) |
| continent | Asia |
| country | Malaysia |
| description | The classical uni-directional conversion algorithms are based on the assumption that prices are arbitrarily chosen from the fixed price interval[m, M] where m and M represent the estimated lower and upper bounds of possible prices 0<m<M. The estimated interval is erroneous and no attempts are made by the algorithms to update the erroneous estimates. We consider a real world setting where prices are interrelated, i.e., each price depends on its preceding price. Under this assumption, we drive a lower bound on the competitive ratio of randomized non-primitive algorithms. Motivated by the fixed and erroneous price bounds, we present an update model that progressively improves the bounds. Based on the update model, we propose a non-preemptive reservations price algorithm RP* and analyze it under competitive analysis. Finally, we report the findings of an experimental study that is conducted over the real world stock index data. We observe that RP* consistently outperforms the classical algorithm. |
| format | Article |
| id | my.iium.irep-74100 |
| institution | Universiti Islam Antarabangsa Malaysia |
| language | en en en |
| publishDate | 2019 |
| publisher | The Science and Information (SAI) Organization Limited |
| record_format | dspace |
| spelling | my.iium.irep-741002020-04-12T15:40:44Z http://irep.iium.edu.my/74100/ Competitive algorithms for online conversion problems with interrelated prices Iqbal, Javeria Ahmad, Iftikhar Shah, Asadullah T10.5 Communication of technical information The classical uni-directional conversion algorithms are based on the assumption that prices are arbitrarily chosen from the fixed price interval[m, M] where m and M represent the estimated lower and upper bounds of possible prices 0<m<M. The estimated interval is erroneous and no attempts are made by the algorithms to update the erroneous estimates. We consider a real world setting where prices are interrelated, i.e., each price depends on its preceding price. Under this assumption, we drive a lower bound on the competitive ratio of randomized non-primitive algorithms. Motivated by the fixed and erroneous price bounds, we present an update model that progressively improves the bounds. Based on the update model, we propose a non-preemptive reservations price algorithm RP* and analyze it under competitive analysis. Finally, we report the findings of an experimental study that is conducted over the real world stock index data. We observe that RP* consistently outperforms the classical algorithm. The Science and Information (SAI) Organization Limited 2019 Article PeerReviewed application/pdf en http://irep.iium.edu.my/74100/7/74100%20Competitive%20Algorithms%20for%20Online%20Conversion.pdf application/pdf en http://irep.iium.edu.my/74100/8/74100%20Competitive%20Algorithms%20for%20Online%20Conversion%20SCOPUS.pdf application/pdf en http://irep.iium.edu.my/74100/19/74100_Competitive%20Algorithms%20for%20Online%20Conversion%20_wos.pdf Iqbal, Javeria and Ahmad, Iftikhar and Shah, Asadullah (2019) Competitive algorithms for online conversion problems with interrelated prices. International Journal of Advanced Computer Science and Applications (IJACSA), 10 (6). pp. 582-589. ISSN 2158-107X E-ISSN 2156-5570 https://thesai.org/Downloads/Volume10No6/Paper_75-Competitive_Algorithms_for_Online_Conversion_Problem.pdf 10.14569/IJACSA.2019.0100675 |
| spellingShingle | T10.5 Communication of technical information Iqbal, Javeria Ahmad, Iftikhar Shah, Asadullah Competitive algorithms for online conversion problems with interrelated prices |
| title | Competitive algorithms for online conversion problems with interrelated prices |
| title_full | Competitive algorithms for online conversion problems with interrelated prices |
| title_fullStr | Competitive algorithms for online conversion problems with interrelated prices |
| title_full_unstemmed | Competitive algorithms for online conversion problems with interrelated prices |
| title_short | Competitive algorithms for online conversion problems with interrelated prices |
| title_sort | competitive algorithms for online conversion problems with interrelated prices |
| topic | T10.5 Communication of technical information |
| url | http://irep.iium.edu.my/74100/7/74100%20Competitive%20Algorithms%20for%20Online%20Conversion.pdf http://irep.iium.edu.my/74100/8/74100%20Competitive%20Algorithms%20for%20Online%20Conversion%20SCOPUS.pdf http://irep.iium.edu.my/74100/19/74100_Competitive%20Algorithms%20for%20Online%20Conversion%20_wos.pdf http://irep.iium.edu.my/74100/ https://thesai.org/Downloads/Volume10No6/Paper_75-Competitive_Algorithms_for_Online_Conversion_Problem.pdf |
| url_provider | http://irep.iium.edu.my/ |