3 papers
cs.DS2026
A Unified Framework for Analysis of Randomized Greedy Matching Algorithms
Mahsa Derakhshan, Tao Yu
Randomized greedy algorithms form one of the simplest yet most effective approaches for computing approximate matchings in graphs. In this paper, we focus on the class of vertex-it…
cs.IT2026
Multi-Agent Reinforcement Learning Counteracts Delayed CSI in Multi-Satellite Systems
Marios Aristodemou, Yasaman Omid, Sangarapillai Lambotharan +2
The integration of satellite communication networks with next-generation (NG) technologies is a promising approach towards global connectivity. However, the quality of services is…
cs.DS2026
Approximation Algorithms for Action-Reward Query-Commit Matching
Mahsa Derakhshan, Andisheh Ghasemi, Calum MacRury
Matching problems under uncertainty arise in applications such as kidney exchange, hiring, and online marketplaces. A decision-maker must sequentially explore potential matches und…