← Authors

MohammadTaghi Hajiaghayi

25 papers · 2017–2025 · 5 conferences · across top CS/AI conferences

Achievements

🐣 Hot Topic Early Bird 🌈 Renaissance Researcher (9) 🐝 Cross-Pollinator (13) πŸ—ΊοΈ Taxonomy Completionist (38) πŸŒ‰ Interdisciplinary Bridge 🌍 Conference Polyglot (5) πŸƒ Academic Marathon (8) 🧭 Keyword Pioneer 🧬 Topic Evolution πŸ—ƒοΈ Keyword Collector (92) πŸš€ Conference Pioneer πŸ’Ž Century Club (25) πŸ”₯ Unstoppable (9) ⚑ Prolific Year (6)

Conferences

NIPS (9) AAAI (6) ICML (6) AISTATS (2) IJCAI (2)

Top co-authors

Max Springer (7) Suho Shin (7) Kiarash Banihashem (7) Alireza Farhadi (4) Samira Goudarzi (3) Morteza Monemizadeh (3) Marina Knittel (3) Peyman Jabbarzade (3) Hadi Yami (3) Hossein Esfandiari (2)

Research topics

Differential Privacy (1)

Keywords

approximation algorithm (9) fair division (5) online algorithm (3) hierarchical clustering (3) mechanism design (3) multi-armed bandit (3) indivisible good (2) regret bound (2) graph algorithm (2) fair clustering (2) cardinality constraint (2) dynamic algorithm (2) sequential decision (2) resource allocation (2) online decision making (1) bayesian learning (1) distributed computing (1) community detection (1) online learning (1) retrieval augmented generation (1)

Papers

Replication-proof Bandit Mechanism Design with Bayesian Agents AAAI 2025
Tokenized Bandit for LLM Decoding and Alignment ICML 2025
Fully Dynamic Embedding into $\ell_p$ Spaces ICML 2025
Dynamic Metric Embedding into lp Space ICML 2024
Fairness and Efficiency in Online Class Matching NIPS 2024
Ad Auctions for LLMs via Retrieval Augmented Generation NIPS 2024
Dueling over Dessert, Mastering the Art of Repeated Cake Cutting NIPS 2024
Almost Envy-Free Allocations of Indivisible Goods or Chores with Entitlements AAAI 2024
A Dynamic Algorithm for Weighted Submodular Cover Problem ICML 2024
An Improved Relaxation for Oracle-Efficient Adversarial Contextual Bandits NIPS 2023
Fair, Polylog-Approximate Low-Cost Hierarchical Clustering NIPS 2023
Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time ICML 2023
Generalized Reductions: Making any Hierarchical Clustering Fair and Balanced with Low Cost ICML 2023
Bandit Social Learning under Myopic Behavior NIPS 2023
Dynamic Non-monotone Submodular Maximization NIPS 2023
Online Algorithms for the Santa Claus Problem NIPS 2022
Generalized Stochastic Matching AAAI 2022
Differentially Private Densest Subgraph AISTATS 2022
Scalable Equilibrium Computation in Multi-agent Influence Games on Networks AAAI 2021
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings AAAI 2021
Prophets, Secretaries, and Maximizing the Probability of Choosing the Best AISTATS 2020
On the Efficiency and Equilibria of Rich Ads IJCAI 2019
Online Pandora’s Boxes and Bandits AAAI 2019
On the Complexity of Chore Division IJCAI 2018
Affinity Clustering: Hierarchical Clustering at Scale NIPS 2017