Showing cs.GTShow all
3 papers · 1 filter
cs.GT2026
Beyond the Half-Approximation: Fair and Efficient Online Class Matching
Sander Borst, Max Springer
Online bipartite matching, where agents are known in advance but items arrive sequentially and must be irrevocably assigned, is fundamental to problems ranging from ride-sharing to…
cs.GT2024
Bi-Criteria Metric Distortion
Kiarash Banihashem, Diptarka Chakraborty, Shayan Chashm Jahan +4
Selecting representatives based on voters' preferences is a fundamental problem in social choice theory. While cardinal utility functions offer a detailed representation of prefere…
cs.GT2024
Fairness and Efficiency in Online Class Matching
MohammadTaghi Hajiaghayi, Shayan Chashm Jahan, Mohammad Sharifi +2
The online bipartite matching problem, extensively studied in the literature, deals with the allocation of online arriving vertices (items) to a predetermined set of offline vertic…