Rad Niazadeh
Rad Niazadeh
Postdoctoral Research Fellow, Stanford University
Email verificata su cs.stanford.edu - Home page
TitoloCitata daAnno
On the achievability of Cramer–Rao bound in noisy compressed sensing
R Niazadeh, M Babaie-Zadeh, C Jutten
IEEE Transactions on Signal Processing 60 (1), 518-526, 2011
372011
Optimal auctions vs. anonymous pricing
S Alaei, J Hartline, R Niazadeh, E Pountourakis, Y Yuan
Proc. 56th Annual IEEE Symposium on Foundations of Computer Science (FOCS …, 2015
362015
Secretary problems with non-uniform arrival order
T Kesselheim, R Kleinberg, R Niazadeh
Proc. 47th ACM Symposium on Theory of Computing (STOC 2015), 879-888, 2015
232015
Multi-scale Online Learning: Theory and Applications to Online Auctions and Pricing
S Bubeck, N Devanur, Z Huang, R Niazadeh
Journal of Machine Learning Research, 2019
20*2019
Simple and near-optimal mechanisms for market intermediation
R Niazadeh, Y Yuan, R Kleinberg
Proc. 10th Conference on Web and Internet Economics (WINE 2014), 386-399, 2014
142014
Bernoulli Factories and Black-Box Reductions in Mechanism Design
S Dughmi, J Hartline, B Kleinberg, R Niazadeh
Proc. 49th ACM Symposium on Theory of Computing (STOC 2017), 2017
112017
GSP—The Cinderella of Mechanism Design
CA Wilkens, R Cavallo, R Niazadeh
Proc. 26th International World Wide Web Conference (WWW 2017), 2017
112017
An alternating minimization method for sparse channel estimation
R Niazadeh, M Babaie-Zadeh, C Jutten
International Conference on Latent Variable Analysis and Signal Separation …, 2010
102010
Hierarchical clustering better than average-linkage
M Charikar, V Chatziafratis, R Niazadeh
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
92019
Mechanism Design for Value Maximizers
C Wilkens, R Cavallo, R Niazadeh, S Taggart
arXiv preprint arXiv:1607.04362v2, 2018
92018
Hierarchical clustering with structural constraints
V Chatziafratis, R Niazadeh, M Charikar
arXiv preprint arXiv:1805.09476, 2018
82018
Optimal algorithms for continuous non-monotone submodular and dr-submodular maximization
R Niazadeh, T Roughgarden, J Wang
Advances in Neural Information Processing Systems, 9594-9604, 2018
82018
ISI sparse channel estimation based on SL0 and its application in ML sequence-by-sequence equalization
R Niazadeh, SH Ghalehjegh, M Babaie-Zadeh, C Jutten
Signal Processing 92 (8), 1875-1885, 2012
82012
Fast Core Pricing for Rich Advertising Auctions
J Hartline, N Immorlica, MR Khani, B Lucier, R Niazadeh
arXiv preprint arXiv:1610.03564v3, 2018
72018
Prophet Inequalities vs. Approximating Optimum Online
R Niazadeh, A Saberi, A Shameli
International Conference on Web and Internet Economics, 356-374, 2018
42018
Adaptive and non-adaptive ISI sparse channel estimation based on SL0 and its application in ML sequence-by-sequence equalization
R Niazadeh, SH Ghalehjegh, M Babaie-Zadeh, C Jutten
International Conference on Latent Variable Analysis and Signal Separation …, 2010
42010
Linear programming based online policies for real-time assortment of reusable resources
Y Feng, R Niazadeh, A Saberi
Available at SSRN 3421227, 2019
32019
Nearly optimal pricing algorithms for production constrained and laminar bayesian selection
N Anari, R Niazadeh, A Saberi, A Shameli
Proceedings of the 2019 ACM Conference on Economics and Computation, 91-92, 2019
32019
Truth and regret in online scheduling
S Chawla, N Devanur, J Kulkarni, R Niazadeh
Proceedings of the 2017 ACM Conference on Economics and Computation, 423-440, 2017
32017
Competitive Equilibria for Non-quasilinear Bidders in Combinatorial Auctions
R Niazadeh, C Wilkens
Proc. 12th Conference on Web and Internet Economics (WINE 2016),, 2016
32016
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20