In many real-life matching problems, waiting agents might abandon before being matched, such as patients deceasing before receiving organs, passengers/drivers cancelling ride requests, or raw materials/intermediary products degrading in production lines. This poses the need for incorporating reneging in stochastic matc...
Many real-life systems can be found as examples of stochastic matching on hypergraphs, such as production lines or assemble-to-order systems. Two common features are the number of items required may vary between matchings, and there may intermediary items which exist as a combination of other items and not of external...
This work introduces online assignment policies, in which each item is assigned to a matching hyperedge type upon arrival, and proves that they are maximally stable, by proving that they are maximally stable.
Doanh Nguyen, A. Bušić· arXiv.org· 4 citations· ⚡1
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.