Mohammad Sharifi — accepted AI-conference papers

2024

Fairness and Efficiency in Online Class Matching

MohammadTaghi Hajiaghayi, Shayan Chashm Jahan, Mohammad Sharifi, Suho Shin, Max Springer

NeurIPS 2024poster

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 vertices (agents). However, little attention has been given to the concept of class fairness, where agents are categorized int…

Cited by 0 Source ↗PDF ↗Scholar ↗

2023

Rainbow Cycle Number and EFX Allocations: (Almost) Closing the Gap

Shayan Chashm Jahan, Masoud Seddighin, Seyed-Mohammad Seyed-Javadi, Mohammad Sharifi

IJCAI 2023poster

Recently, some studies on the fair allocation of indivisible goods notice a connection between a purely combinatorial problem called the Rainbow Cycle problem and a fairness notion known as EFX: assuming that the rainbow cycle number for parameter d (i.e. R(d)) is O(d^β .log(d)^γ), we can find a (1…

Cited by 14 Source ↗PDF ↗Scholar ↗