IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v14y2026i2p206-d1833944.html

The Weighted k -Search Problem

Author

Listed:
  • Michael Schwarz

    (Faculty of Business Administration and Economics, Rotenbühl Campus, University of Applied Sciences for Technology and Business Saarland, Goebenstraße 40, 66117 Saarbrücken, Germany)

  • Robert Dochow

    (Faculty of Business Administration and Economics, Rotenbühl Campus, University of Applied Sciences for Technology and Business Saarland, Goebenstraße 40, 66117 Saarbrücken, Germany)

Abstract

In the uni-directional conversion problem, the objective is to convert wealth from one asset into another while maximizing its value at the end of the investment horizon. In the k -preemptive variant of this problem, also known as the k -search problem, the wealth is divided into k equally-sized units that cannot be converted simultaneously. In this work the weighted k -search problem is introduced. The weighted k -search problem is a generalization of the k -search problem, since the problem setting is changed in a way in which the given number of units to convert is not limited to one. In the weighted k -search problem, the k units are grouped into l groups of variable size. Instead of one unit, each group has to be converted at once, and each group has to be converted separately. The online algorithm lRPP is presented and its competitive ratio is determined. It is shown that no deterministic algorithm can achieve a lower competitive ratio. Thus, lRPP solves the weighted k -search problem optimally. Both variants of the weighted k -search problem, i.e., min-search and max-search, are solved separately.

Suggested Citation

  • Michael Schwarz & Robert Dochow, 2026. "The Weighted k -Search Problem," Mathematics, MDPI, vol. 14(2), pages 1-13, January.
    • Handle: RePEc:gam:jmathe:v:14:y:2026:i:2:p:206-:d:1833944
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/14/2/206/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/14/2/206/
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:gam:jmathe:v:14:y:2026:i:2:p:206-:d:1833944. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: MDPI Indexing Manager The email address of this maintainer does not seem to be valid anymore. Please ask MDPI Indexing Manager to update the entry or send us the correct address (email available below). General contact details of provider: https://www.mdpi.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.