Scholar
Masoud Seddighin
Google Scholar ID: 4hPh0toAAAAJ
Tehran Institute for Advanced Studies (TEIAS)
Approximation Algorithms
Algorithmic game theory
Computational Social Choice
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
622
H-index
13
i10-index
14
Publications
20
Co-authors
20
list available
Contact
No contact links provided.
Publications
10 items
Dynamic Pattern Matching with Wildcards
2026
Cited
0
Metric Distortion with Preference Intensities
arXiv.org · 2026
Cited
0
Fair Assignment of Indivisible Chores to Asymmetric Agents
2025
Cited
0
Improved Maximin Share Guarantee for Additive Valuations
2025
Cited
0
Tight Bounds On the Distortion of Randomized and Deterministic Distributed Voting
2025
Cited
0
Quantum Pattern Matching with Wildcards
2025
Cited
0
Lower Bound for Online MMS Assignment of Indivisible Chores
2025
Cited
0
Improved Approximate EFX Guarantees for Multigraphs
2025
Cited
0
Load more
Resume (English only)
Co-authors
20 total
Co-author 1
Saeed Seddighin
Toyota Technological Institute at Chicago
MohammadTaghi Hajiaghayi
ACM Fellow, Jack and Rita Minker Professor of Computer Science, University of Maryland, College Park
Co-author 4
Mohamad Latifian
University of Edinburgh
Xiaorui Sun
University of Illinois at Chicago
David M Pennock
Professor, Rutgers University
Golnoosh Shahkarami
Max-Planck-Institut für Informatik
×
Welcome back
Sign in to Agora
Welcome back! Please sign in to continue.
Email address
Password
Forgot password?
Continue
Do not have an account?
Sign up