1 citations · 1 across the 27 of their papers we have counts for
6 papers · 1 filter
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…
Dynamic Metric Embedding into Space
Kiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz R. Kowalski +2
We give the first non-trivial decremental dynamic embedding of a weighted, undirected graph into space. Given a weighted graph undergoing a sequence of edge weight…
Ad Auctions for LLMs via Retrieval Augmented Generation
MohammadTaghi Hajiaghayi, Sébastien Lahaie, Keivan Rezaei +1
In the field of computational advertising, the integration of ads into the outputs of large language models (LLMs) presents an opportunity to support these services without comprom…
Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why is a Lot of Randomness Needed?
Mohammad T. Hajiaghayi, Dariusz R. Kowalski, Jan Olkowski
We study the problem of reaching agreement in a synchronous distributed system by autonomous parties, when the communication links from/to faulty parties can omit messages. The…
Dueling Over Dessert, Mastering the Art of Repeated Cake Cutting
Simina Brânzei, MohammadTaghi Hajiaghayi, Reed Phillips +2
We consider the setting of repeated fair division between two players, denoted Alice and Bob, with private valuations over a cake. In each round, a new cake arrives, which is ident…