A Decentralized Matching Theory Framework to Match Data and Algorithms Providers

Issaid, Chaouki Ben; Bennis, Mehdi (2025-04-14)
 
Avaa tiedosto
Lataukset: 

URL:
https://doi.org/10.1109/LNET.2025.3560459

Issaid, Chaouki Ben
Bennis, Mehdi
IEEE
14.04.2025

C. B. Issaid and M. Bennis, "A Decentralized Matching Theory Framework to Match Data and Algorithms Providers," in IEEE Networking Letters, doi: 10.1109/LNET.2025.3560459.

https://creativecommons.org/licenses/by/4.0/
© The Author(s) 2025. This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.
https://creativecommons.org/licenses/by/4.0/
doi:https://doi.org/10.1109/LNET.2025.3560459
Näytä kaikki kuvailutiedot
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi:oulu-202504242880
Tiivistelmä
Abstract

This paper presents a novel decentralized matching algorithm (DEMA) for pairing data and algorithm providers in AI ecosystems. DEMA addresses scalability, stability, and matching utility challenges in large-scale environments. Formulated as a two-sided matching game, our decentralized solution enables autonomous decision-making based on local information. Simulations demonstrate DEMA’s near-optimal matching quality and almost perfect stability. Furthermore, DEMA exhibits excellent scalability with execution times and memory usage growing much more slowly than centralized matching as the number of providers increases.
Kokoelmat
https://creativecommons.org/licenses/by/4.0/
Ellei muuten mainita, aineiston lisenssi on https://creativecommons.org/licenses/by/4.0/