3 citations · 4 across the 9 of their papers we have counts for
10 papers
Metric Distortion with Preference Intensities
Mehrad Abbaszadeh, Ali Ansarifar, Mohamad Latifian +1
In voting with ranked ballots, each agent submits a strict ranking of the form over the alternatives, and the voting rule decides on the winner based on…
Optimal Metric Distortion for Matching on the Line
Aris Filos-Ratsikas, Vasilis Gkatzelis, Mohamad Latifian +2
We study the distortion of one-sided and two-sided matching problems on the line. In the one-sided case, agents need to be matched to items, and each agent's cost in a matc…
Towards Fair and Efficient Public Transportation: A Bus Stop Model
Martin Bullinger, Edith Elkind, Mohamad Latifian
We consider a stylized formal model of public transportation, where a set of agents need to travel along a given road, and there is a bus that runs the length of this road. Each ag…
Fair Division with Market Values
Siddharth Barman, Soroush Ebadian, Mohamad Latifian +1
We introduce a model of fair division with market values, where indivisible goods must be partitioned among agents with (additive) subjective valuations, and each good additionally…
Temporal Fair Division of Indivisible Items
Edith Elkind, Alexander Lam, Mohamad Latifian +2
We study a fair division model where indivisible items arrive sequentially, and must be allocated immediately and irrevocably. Previous work on online fair division has shown impos…
The Distortion of Threshold Approval Matching
Mohamad Latifian, Alexandros A. Voudouris
We study matching settings in which a set of agents have private utilities over a set of items. Each agent reports a partition of the items into approval sets of different threshol…
Best of Both Distortion Worlds
Vasilis Gkatzelis, Mohamad Latifian, Nisarg Shah
We study the problem of designing voting rules that take as input the ordinal preferences of agents over a set of alternatives and output a single alternative, aiming to op…
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings
Alireza Farhadi, MohammadTaghi Hajiaghayi, Mohamad Latifian +2
Envy-free up to one good (EF1) and envy-free up to any good (EFX) are two well-known extensions of envy-freeness for the case of indivisible items. It is shown that EF1 can always…
Resource-Aware Protocols for Network Cost-Sharing Games
George Christodoulou, Vasilis Gkatzelis, Mohamad Latifian +1
We study the extent to which decentralized cost-sharing protocols can achieve good price of anarchy (PoA) bounds in network cost-sharing games with agents. We focus on the mode…
On the Distortion Value of the Elections with Abstention
Mohammad Ghodsi, Mohamad Latifian, Masoud Seddighin
In Spatial Voting Theory, distortion is a measure of how good the winner is. It is proved that no deterministic voting mechanism can guarantee a distortion better than , even fo…