MohammadTaghi Hajiaghayi

MohammadTaghi Hajiaghayi

University of Maryland

H-index: 73

North America-United States

About MohammadTaghi Hajiaghayi

MohammadTaghi Hajiaghayi, With an exceptional h-index of 73 and a recent h-index of 44 (since 2020), a distinguished researcher at University of Maryland, specializes in the field of Algorithms, Game Theory, Network Design, Social Networks, BIG Networks.

His recent articles reflect a diverse array of research interests and contributions to the field:

Almost Envy-Free Allocations of Indivisible Goods or Chores with Entitlements

Regret analysis of repeated delegated choice

Dueling Over Dessert, Mastering the Art of Repeated Cake Cutting

Bandit Social Learning under Myopic Behavior

Fair, Polylog-Approximate Low-Cost Hierarchical Clustering

An improved relaxation for oracle-efficient adversarial contextual bandits

Power of Posted-price Mechanisms for Prophet Inequalities

2-Approximation for Prize-Collecting Steiner Forest

MohammadTaghi Hajiaghayi Information

University

Position

ACM Fellow Jack and Rita Minker Professor of Computer Science

Citations(all)

16861

Citations(since 2020)

6455

Cited By

13518

hIndex(all)

73

hIndex(since 2020)

44

i10Index(all)

242

i10Index(since 2020)

163

Email

University Profile Page

Google Scholar

MohammadTaghi Hajiaghayi Skills & Research Interests

Algorithms

Game Theory

Network Design

Social Networks

BIG Networks

Top articles of MohammadTaghi Hajiaghayi

Almost Envy-Free Allocations of Indivisible Goods or Chores with Entitlements

arXiv preprint arXiv:2305.16081

2023/5/25

Mohammadtaghi Hajiaghayi
Mohammadtaghi Hajiaghayi

H-Index: 43

Regret analysis of repeated delegated choice

Proceedings of the AAAI Conference on Artificial Intelligence

2024/3/24

Dueling Over Dessert, Mastering the Art of Repeated Cake Cutting

arXiv preprint arXiv:2402.08547

2024/2/13

Mohammadtaghi Hajiaghayi
Mohammadtaghi Hajiaghayi

H-Index: 43

Kun Wang
Kun Wang

H-Index: 6

Bandit Social Learning under Myopic Behavior

Advances in Neural Information Processing Systems

2024/2/13

Mohammadtaghi Hajiaghayi
Mohammadtaghi Hajiaghayi

H-Index: 43

Fair, Polylog-Approximate Low-Cost Hierarchical Clustering

Advances in Neural Information Processing Systems

2024/2/13

Mohammadtaghi Hajiaghayi
Mohammadtaghi Hajiaghayi

H-Index: 43

An improved relaxation for oracle-efficient adversarial contextual bandits

Advances in Neural Information Processing Systems

2024/2/13

Mohammadtaghi Hajiaghayi
Mohammadtaghi Hajiaghayi

H-Index: 43

Power of Posted-price Mechanisms for Prophet Inequalities

2024

Mohammadtaghi Hajiaghayi
Mohammadtaghi Hajiaghayi

H-Index: 43

Piotr Krysta
Piotr Krysta

H-Index: 11

2-Approximation for Prize-Collecting Steiner Forest

2024

Mohammadtaghi Hajiaghayi
Mohammadtaghi Hajiaghayi

H-Index: 43

Mohammad Mahdavi
Mohammad Mahdavi

H-Index: 6

Dynamic algorithms for matroid submodular maximization

2024

Mohammadtaghi Hajiaghayi
Mohammadtaghi Hajiaghayi

H-Index: 43

Morteza Monemizadeh
Morteza Monemizadeh

H-Index: 13

Exponentially faster massively parallel maximal matching

Journal of the ACM

2023

Soheil Behnezhad
Soheil Behnezhad

H-Index: 11

Mohammadtaghi Hajiaghayi
Mohammadtaghi Hajiaghayi

H-Index: 43

Delegating to Multiple Agents

2023/7/9

Mohammadtaghi Hajiaghayi
Mohammadtaghi Hajiaghayi

H-Index: 43

Trading Prophets

2023

Andrés Cristi
Andrés Cristi

H-Index: 4

Mohammadtaghi Hajiaghayi
Mohammadtaghi Hajiaghayi

H-Index: 43

Kevin Schewior
Kevin Schewior

H-Index: 9

Dynamic constrained submodular optimization with polylogarithmic update time

2023/7/3

Mohammadtaghi Hajiaghayi
Mohammadtaghi Hajiaghayi

H-Index: 43

Morteza Monemizadeh
Morteza Monemizadeh

H-Index: 13

Generalized reductions: making any hierarchical clustering fair and balanced with low cost

2023/7/3

Mohammadtaghi Hajiaghayi
Mohammadtaghi Hajiaghayi

H-Index: 43

Optimal sparse recovery with decision stumps

Proceedings of the AAAI Conference on Artificial Intelligence

2023/6/26

Brief Announcement: Improved Consensus in Quantum Networks

2023/6/19

Mohammadtaghi Hajiaghayi
Mohammadtaghi Hajiaghayi

H-Index: 43

Location-Sensitive String Problems in MPC

2023/6/17

Mohammadtaghi Hajiaghayi
Mohammadtaghi Hajiaghayi

H-Index: 43

Hamed Saleh
Hamed Saleh

H-Index: 2

Saeed Seddighin
Saeed Seddighin

H-Index: 11

Massively parallel tree embeddings for high dimensional spaces

2023/6/17

Mohammadtaghi Hajiaghayi
Mohammadtaghi Hajiaghayi

H-Index: 43

Peilin Zhong
Peilin Zhong

H-Index: 11

Brief Announcement: Regular and Dyck Languages in MPC

2023/6/17

Mohammadtaghi Hajiaghayi
Mohammadtaghi Hajiaghayi

H-Index: 43

Weighted edit distance computation: Strings, trees, and Dyck

2023/6/2

See List of Professors in MohammadTaghi Hajiaghayi University(University of Maryland)

Co-Authors

academic-engine