IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v49y2025i1d10.1007_s10878-024-01228-5.html
   My bibliography  Save this article

Incentive mechanism design for value-decreasing tasks in dynamic competitive edge computing networks

Author

Listed:
  • Qie Li

    (Harbin Institute of Technology (Shenzhen))

  • Zichen Wang

    (Harbin Institute of Technology (Shenzhen))

  • Hongwei Du

    (Harbin Institute of Technology (Shenzhen))

Abstract

With the rapid development of network architectures and application technologies, there is an increasing number of latency-sensitive tasks generated by user devices, necessitating real-time processing on edge servers. During peak periods, user devices compete for limited edge resources to execute their tasks, while different edge servers also compete for transaction opportunities. This article focus on resource allocation problems in competitive edge networks with multiple participants. Considering the decreasing value of tasks over time, a Greedy Method with Priority Order (GMPO) mechanism based on auction theory is designed to maximize the overall utility of the entire network. This mechanism consists of a short-slot optimal resource allocation phase, a winner determination phase that ensures monotonicity, and a pricing phase based on critical prices. Theoretical analysis demonstrates that the GMPO mechanism can prevent user devices from engaging in dishonest transactions. Experimental results indicate that it significantly enhances the overall utility of competitive edge networks.

Suggested Citation

  • Qie Li & Zichen Wang & Hongwei Du, 2025. "Incentive mechanism design for value-decreasing tasks in dynamic competitive edge computing networks," Journal of Combinatorial Optimization, Springer, vol. 49(1), pages 1-18, January.
    • Handle: RePEc:spr:jcomop:v:49:y:2025:i:1:d:10.1007_s10878-024-01228-5
    DOI: 10.1007/s10878-024-01228-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-024-01228-5
    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-024-01228-5?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.

    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:49:y:2025:i:1:d:10.1007_s10878-024-01228-5. 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: 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.