2 citations · 2 across the 13 of their papers we have counts for
6 papers · 1 filter
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…
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…
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…
Almost Envy-Free Allocations of Indivisible Goods or Chores with Entitlements
MohammadTaghi Hajiaghayi, Max Springer, Hadi Yami
We here address the problem of fairly allocating indivisible goods or chores to agents with weights that define their entitlement to the set of indivisible resources. Stemming…
Online Algorithms for the Santa Claus Problem
MohammadTaghi Hajiaghayi, MohammadReza Khani, Debmalya Panigrahi +1
The Santa Claus problem is a fundamental problem in fair division: the goal is to partition a set of heterogeneous items among heterogeneous agents so as to maximize the minimum va…
Analysis of a Learning Based Algorithm for Budget Pacing
MohammadTaghi Hajiaghayi, Max Springer
In this paper, we analyze a natural learning algorithm for uniform pacing of advertising budgets, equipped to adapt to varying ad sale platform conditions. On the demand side, adve…