IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v34y2017i4d10.1007_s10878-017-0131-3.html
   My bibliography  Save this article

Competitive analysis of bi-directional non-preemptive conversion

Author

Listed:
  • Günter Schmidt

    (Saarland University
    Germany and University of Cape Town)

Abstract

In an online conversion problem a player is converting one asset into another, e.g. dollars to yen, based on a finite sequence of unknown future conversion rates. When a new rate is announced the player must decide how many dollars (yen) to convert to yen (dollars) according to this rate. Conversion is over when the last rate has appeared. The objective is to maximize terminal wealth after conversion. In uni-directional conversion dollars are converted to yen and in bi-directional conversion not only dollars to yen but also yen to dollars may be converted. If all current wealth has to be converted at one rate we call the problem non-preemptive; if parts of the current wealth can be converted at one rate we call it preemptive. We assume that lower and upper bounds on conversion rates are given. Uni-directional preemptive and non-preemptive and bi-directional preemptive conversion is investigated in El Yaniv et al. (Proceeding 33rd annual symposium on foundations of computer science, pp 327–333, 1992, Algorithmica 30:101–139, 2001). Their results for bi-directional preemptive conversion are improved by Dannoura and Sakurai (Inf Process Lett 66:27–33, 1998). The suggested improvement is conjectured not to be optimal for bi-directional preemptive conversion. There are no results for optimal bi-directional non-preemptive conversion. We investigate the problem of bi-directional non-preemptive online conversion. We present lower bounds, upper bounds and an optimal algorithm to solve the problem. Moreover, we prove that the algorithm of Dannoura and Sakurai 1998 is not optimal for bi-directional preemptive conversion.

Suggested Citation

  • Günter Schmidt, 2017. "Competitive analysis of bi-directional non-preemptive conversion," Journal of Combinatorial Optimization, Springer, vol. 34(4), pages 1096-1113, November.
  • Handle: RePEc:spr:jcomop:v:34:y:2017:i:4:d:10.1007_s10878-017-0131-3
    DOI: 10.1007/s10878-017-0131-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-017-0131-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-017-0131-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Wenming Zhang & Yinfeng Xu & Feifeng Zheng & Yucheng Dong, 2012. "Optimal algorithms for online time series search and one-way trading with interrelated prices," Journal of Combinatorial Optimization, Springer, vol. 23(2), pages 159-166, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wenming Zhang & Ye Zhang & Yongxi Cheng & Shankui Zheng, 2022. "An online trading problem with an increasing number of available products," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 518-531, August.
    2. Pascal Schroeder & Imed Kacem, 2022. "Optimal solutions for online conversion problems with interrelated prices," Operational Research, Springer, vol. 22(1), pages 423-448, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wang, Wei & Lan, Yingjie, 2022. "Robust one-way trading with limited number of transactions and heuristics for fixed transaction costs," International Journal of Production Economics, Elsevier, vol. 247(C).
    2. Mohr, Esther, 2017. "Optimal replenishment under price uncertainty," European Journal of Operational Research, Elsevier, vol. 258(1), pages 136-143.
    3. Wenming Zhang & Ye Zhang & Yongxi Cheng & Shankui Zheng, 2022. "An online trading problem with an increasing number of available products," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 518-531, August.
    4. Pascal Schroeder & Imed Kacem, 2022. "Optimal solutions for online conversion problems with interrelated prices," Operational Research, Springer, vol. 22(1), pages 423-448, March.
    5. Wang, Liying & Lan, Yingjie & Zhang, Jean X., 2016. "Competitive difference analysis of the one-way trading problem with limited informationAuthor-Name: Wang, Wei," European Journal of Operational Research, Elsevier, vol. 252(3), pages 879-887.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:34:y:2017:i:4:d:10.1007_s10878-017-0131-3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.