1 citations · 1 across the 27 of their papers we have counts for
11 papers · 1 filter
Optimally Curating an Event
MohammadTaghi Hajiaghayi, Sebastien Lahaie, Mohammad Mahdavi +1
We study the optimal design of a self-financing event, a problem that requires balancing the recruitment of costly, positive-value participants with revenue-generating agents who m…
Algorithmic Delegated Choice: An Annotated Reading List
Mohammad T. Hajiaghayi, Suho Shin
The problem of delegated choice has been of long interest in economics and recently on computer science. We overview a list of papers on delegated choice problem, from classic work…
Delegation with Costly Inspection
Mohammad T. Hajiaghayi, Piotr Krysta, Mohammad Mahdavi +1
We study the problem of delegated choice with inspection cost (DCIC), which is a variant of the delegated choice problem by Kleinberg and Kleinberg (EC'18) as well as an extension…
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…
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…
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…
Regret Analysis of Repeated Delegated Choice
MohammadTaghi Hajiaghayi, Mohammad Mahdavi, Keivan Rezaei +1
We present a study on a repeated delegated choice problem, which is the first to consider an online learning variant of Kleinberg and Kleinberg, EC'18. In this model, a principal i…
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…