Similar Search Results

Online stochastic matching : new algorithms with better bounds

Jaillet, Patrick; Lu, Xin - In: Mathematics of operations research 39 (2014) 3, pp. 624-646

Persistent link: https://www.econbiz.de/10010402969

Algorithmic Assortative Matching on a Digital Social Medium

López Vargas, Kristian; Runge, Julian; Zhang, Ruizhi … - 2022

Humans are increasingly interacting in and operating their daily lives through structured digital and virtual environments, mainly through apps that provide media for sharing photos, messaging, gaming, collaborating, or video watching. Most of these digital environments are offered under...

Persistent link: https://www.econbiz.de/10013313117

Matchings with lower quotas : algorithms and complexity

Arulselvan, Ashwin; Cseh, Ágnes; Groß, Martin; … - 2017

also discussed: we present an approximation algorithm for the general case with performance guarantee Umax + 1, which is …

Persistent link: https://www.econbiz.de/10011757194

The stable roommates problem with short lists

Cseh, Ágnes; Irving, Robert W.; Manlove, David F. - 2017

that this problem is NP-hard even if d = 3. On the positive side we give a 2d+3 / 7-approximation algorithm for d {3, 4, 5 …

Persistent link: https://www.econbiz.de/10011757492

Dynamic stochastic matching under limited time

Aouad, Ali; Sarıtaç, Ömer - In: Operations research 70 (2022) 4, pp. 2349-2383

Persistent link: https://www.econbiz.de/10013366461

Edge-weighted online windowed matching

Ashlagi, Itai; Burq, Maximilien; Dutta, Chinmoy; … - In: Mathematics of operations research 48 (2023) 2, pp. 999-1016

Persistent link: https://www.econbiz.de/10014314971

Prediction Algorithms in Matching Platforms

Hamalainen, Saara; Petrikaite, Vaiva - 2023

We provide a general framework to consider the effects of algorithmic demand and supply prediction in matching platforms, such as Task Rabbit for labor markets or Amazon for goods markets, where a significant proportion of matches are repeat transactions. We show that algorithmic repeat match...

Persistent link: https://www.econbiz.de/10014350609

Centralized and decentralized algorithms for two-to-one matching problem in ridehailing systems

Meshkani, Seyed Mehdi; Farooq, Bilal - In: EURO journal on transportation and logistics 12 (2023), pp. 1-16

In the context of on-demand ridehailing, we propose a heuristic matching algorithm where a passenger can share their … the performance, we implemented the algorithm in a traffic microsimulator and compared it with a ride-matching algorithm …%, compared to the IBM algorithm. The decentralized version demonstrated a 25.53 times speedup and the service rate improved by 19 …

Persistent link: https://www.econbiz.de/10014518054

Popular matchings with weighted voters

Heeger, Klaus; Cseh, Ágnes - In: Games and economic behavior 144 (2024), pp. 300-328

Persistent link: https://www.econbiz.de/10014545398

A nonasymptotic analysis for re-solving heuristic in online matching

Wang, Hao; Yan, Zhenzhen; Bei, Xiaohui - In: Production and operations management : the flagship … 31 (2022) 8, pp. 3096-3124

Persistent link: https://www.econbiz.de/10013419026

1
2
3
4
5
6
7
8
9
10
Next
Last