Nika Haghtalab
Title
Cited by
Cited by
Year
Learning optimal commitment to overcome insecurity
A Blum, N Haghtalab, AD Procaccia
Advances in Neural Information Processing Systems 27, 1826-1834, 2014
732014
Commitment Without Regrets: Online Learning in Stackelberg Security Games
MF Balcan, A Blum, N Haghtalab, AD Procaccia
722015
Learning and 1-bit compressed sensing under asymmetric noise
P Awasthi, MF Balcan, N Haghtalab, H Zhang
Conference on Learning Theory, 152-192, 2016
692016
Efficient learning of linear separators under bounded noise
P Awasthi, MF Balcan, N Haghtalab, R Urner
Conference on Learning Theory, 167-190, 2015
682015
Ignorance is almost bliss: Near-optimal stochastic matching with few queries
A Blum, JP Dickerson, N Haghtalab, AD Procaccia, T Sandholm, ...
Proceedings of the Sixteenth ACM Conference on Economics and Computation …, 2015
472015
Oracle-efficient online learning and auction design
M Dudík, N Haghtalab, H Luo, RE Schapire, V Syrgkanis, JW Vaughan
2017 ieee 58th annual symposium on foundations of computer science (focs …, 2017
402017
Clustering in the Presence of Background Noise
S Ben-David, N Haghtalab
International Conference in Machine Learning (ICML 2014), 2014
292014
The provable virtue of laziness in motion planning
N Haghtalab, S Mackenzie, A Procaccia, O Salzman, S Srinivasa
Proceedings of the International Conference on Automated Planning and …, 2018
272018
Three strategies to success: Learning adversary models in security games
N Haghtalab, F Fang, TH Nguyen, A Sinha, AD Procaccia, M Tambe
272016
Lazy Defenders Are Almost Optimal Against Diligent Attackers
A Blum, N Haghtalab, AD Procaccia
28th AAAI Conference on Artificial Intelligence, 2014
272014
Maximizing welfare with incentive-aware evaluation mechanisms
N Haghtalab, N Immorlica, B Lucier, JZ Wang
arXiv preprint arXiv:2011.01956, 2020
242020
The disparate equilibria of algorithmic decision making when individuals invest rationally
LT Liu, A Wilson, N Haghtalab, AT Kalai, C Borgs, J Chayes
Proceedings of the 2020 Conference on Fairness, Accountability, and …, 2020
242020
Collaborative PAC learning
A Blum, N Haghtalab, AD Procaccia, M Qiao
NIPS 2017, 2017
232017
-center Clustering under Perturbation Resilience
MF Balcan, N Haghtalab, C White
arXiv preprint arXiv:1505.03924, 2015
18*2015
Opting into optimal matchings
A Blum, I Caragiannis, N Haghtalab, AD Procaccia, EB Procaccia, ...
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
172017
Structured robust submodular maximization: Offline and online algorithms
N Anari, N Haghtalab, S Naor, S Pokutta, M Singh, A Torrico
The 22nd International Conference on Artificial Intelligence and Statistics …, 2019
162019
Online Learning with a Hint.
O Dekel, A Flajolet, N Haghtalab, P Jaillet
NIPS, 5299-5308, 2017
162017
Efficient PAC learning from the crowd
P Awasthi, A Blum, N Haghtalab, Y Mansour
Conference on Learning Theory, 127-150, 2017
132017
Ignorance is almost bliss: Near-optimal stochastic matching with few queries
A Blum, JP Dickerson, N Haghtalab, AD Procaccia, T Sandholm, ...
Operations research 68 (1), 16-34, 2020
92020
k-center Clustering under Perturbation Resilience
MF Balcan, N Haghtalab, C White
ACM Transactions on Algorithms (TALG) 16 (2), 1-39, 2020
72020
The system can't perform the operation now. Try again later.
Articles 1–20