I am Ali Mortazavi. I am a Ph.D. student at the CS department at University of Victoria working on online learning under the supervision of Prof. Nishant Mehta.
Previously, I did my undergrad and master’s in the Computer Engineering department of AmirKabir University of Technology. I also did a summer research internship on online stochastic matching at ITCS group at Shanghai University of Finance and Economics (SUFE) under the supervision of Prof. Nick Gravin.

Publications

• On the price of exact truthfulness in incentive-compatible online learning with bandit feedback: A regret lower bound for WSU-UX
  • Authors: Ali Mortazavi, Junhao Lin, Nishant Mehta
  • Conference: AISTATS 2024, [arXiv]
• Best-case lower bounds in online learning
  • Authors: Cristóbal Guzmán, Nishant Mehta, Ali Mortazavi
  • Conference: NeurIPS 2021, [arXiv]

RESEARCH INTEREST

In general, I am interested in problems in the intersection of learning theory, game theory and algorithms under uncertainty. I’m currently working on “learning under the presence of strategic agents”, and also some problems in online convex optimization. Basically, as long as there is a nice theoretical question that I can make some progress on, I’m in! But let’s list my interests here:

• Online Learning
• Algorithmic Game Theory
• Mechanism Design ( for social good!)
• Online (Stochastic) Algorithms