MohammadTaghi Hajiaghayi
25 papers · 2017–2025 · 5 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+8 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (37) π Academic Marathon Β· Sprint π Conference Polyglot Β· Silver π Interdisciplinary Bridge Β· Gold π£ Hot Topic Early Bird
π
Keyword Champion
(2)
π¬
Deep Specialist
(10)
π
Renaissance Researcher
(7)
π₯
Unstoppable Β· Bronze
β‘
Prolific Year Β· Productive
π
Conference Pioneer
π
Century Club Β· Bronze
ποΈ
Keyword Collector
(111)
Top co-authors
Research topics
Mathematics & Optimization
(22)
Optimization
(22)
Machine Learning
(16)
Artificial Intelligence
(8)
Core AI
(8)
Optimization & Theory
(8)
Computer Science
(6)
Foundations
(6)
Core Methods
(5)
Learning Types
(5)
Data Science & Analytics
(4)
Application Areas
(4)
Applications
(4)
Reinforcement Learning
(2)
Mathematics
(2)
Keywords
approximation algorithm
(9)
fair division
(5)
multi-armed bandit
(4)
hierarchical clustering
(3)
online algorithm
(3)
dynamic algorithm
(3)
mechanism design
(3)
regret bound
(2)
indivisible good
(2)
distortions
(2)
randomized algorithm
(2)
graph algorithm
(2)
cardinality constraint
(2)
sequential decision
(2)
resource allocation
(2)
fair clustering
(2)
online decision making
(1)
game theory
(1)
distributed computing
(1)
community detection
(1)
Papers
Fully Dynamic Embedding into β_p Spaces
ICML 2025
Replication-proof Bandit Mechanism Design with Bayesian Agents
AAAI 2025
Tokenized Bandit for LLM Decoding and Alignment
ICML 2025
Ad Auctions for LLMs via Retrieval Augmented Generation
NeurIPS 2024
A Dynamic Algorithm for Weighted Submodular Cover Problem
ICML 2024
Almost Envy-Free Allocations of Indivisible Goods or Chores with Entitlements
AAAI 2024
Dueling over Dessert, Mastering the Art of Repeated Cake Cutting
NeurIPS 2024
Dynamic Metric Embedding into lp Space
ICML 2024
Fairness and Efficiency in Online Class Matching
NeurIPS 2024
An Improved Relaxation for Oracle-Efficient Adversarial Contextual Bandits
NeurIPS 2023
Bandit Social Learning under Myopic Behavior
NeurIPS 2023
Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time
ICML 2023
Dynamic Non-monotone Submodular Maximization
NeurIPS 2023
Fair, Polylog-Approximate Low-Cost Hierarchical Clustering
NeurIPS 2023
Generalized Reductions: Making any Hierarchical Clustering Fair and Balanced with Low Cost
ICML 2023
Differentially Private Densest Subgraph
AISTATS 2022
Generalized Stochastic Matching
AAAI 2022
Online Algorithms for the Santa Claus Problem
NeurIPS 2022
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings
AAAI 2021
Scalable Equilibrium Computation in Multi-agent Influence Games on Networks
AAAI 2021
Prophets, Secretaries, and Maximizing the Probability of Choosing the Best
AISTATS 2020
Online Pandoraβs Boxes and Bandits
AAAI 2019
On the Efficiency and Equilibria of Rich Ads
IJCAI 2019
On the Complexity of Chore Division
IJCAI 2018
Affinity Clustering: Hierarchical Clustering at Scale
NeurIPS 2017