Rad Niazadeh

Orcid: 0000-0002-5880-6221

According to our database1, Rad Niazadeh authored at least 47 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Bernoulli Factories for Flow-Based Polytopes.
SIAM J. Discret. Math., March, 2024

Misalignment, Learning, and Ranking: Harnessing Users Limited Attention.
CoRR, 2024

2023
Fair Dynamic Rationing.
Manag. Sci., November, 2023

Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization.
Manag. Sci., July, 2023

Sequential Submodular Maximization and Applications to Ranking an Assortment of Products.
Oper. Res., July, 2023

Online Resource Allocation with Buyback: Optimal Algorithms via Primal-Dual.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Correlated Cluster-Based Randomized Experiments: Robust Variance Minimization.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2022
Fast Core Pricing for Rich Advertising Auctions.
Oper. Res., 2022

Batching and Optimal Multi-stage Bipartite Allocations.
CoRR, 2022

Two-stage Stochastic Matching and Pricing with Applications to Ride Hailing.
CoRR, 2022

Near-Optimal Bayesian Online Assortment of Reusable Resources.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Online Bipartite Matching with Reusable Resources.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Descending Price Auctions with Bounded Number of Price Levels and Batched Prophet Inequality.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

2021
Bernoulli Factories and Black-box Reductions in Mechanism Design.
J. ACM, 2021

Combinatorial Bernoulli factories: matchings, flows, and other polytopes.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Two-stage Stochastic Matching with Application to Ride Hailing.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Batching and Optimal Multi-Stage Bipartite Allocations (Extended Abstract).
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020
Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization.
J. Mach. Learn. Res., 2020

No-Regret Stateful Posted Pricing.
CoRR, 2020

Ranking an Assortment of Products via Sequential Submodular Optimization.
CoRR, 2020

Stateful Posted Pricing with Vanishing Regret via Dynamic Deterministic Markov Decision Processes.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019
Multi-scale Online Learning: Theory and Applications to Online Auctions and Pricing.
J. Mach. Learn. Res., 2019

Optimal auctions vs. anonymous pricing.
Games Econ. Behav., 2019

Persuasion and Incentives Through the Lens of Duality.
Proceedings of the Web and Internet Economics - 15th International Conference, 2019

Hierarchical Clustering better than Average-Linkage.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Nearly Optimal Pricing Algorithms for Production Constrained and Laminar Bayesian Selection.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

Hierarchical Clustering for Euclidean Data.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
Prophet Inequalities vs. Approximating Optimum Online.
Proceedings of the Web and Internet Economics - 14th International Conference, 2018

Hierarchical Clustering with Structural Constraints.
Proceedings of the 35th International Conference on Machine Learning, 2018

2017
Algorithms vs. Mechanisms: Mechanism Design for Complex Environments.
PhD thesis, 2017

Algorithms versus mechanisms: how to cope with strategic input?
XRDS, 2017

GSP: The Cinderella of Mechanism Design.
Proceedings of the 26th International Conference on World Wide Web, 2017

Truth and Regret in Online Scheduling.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Online Auctions and Multi-scale Online Learning.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

2016
Mechanism Design for Value Maximizers.
CoRR, 2016

Finding Bidder-Optimal Core Points Quickly.
CoRR, 2016

Competitive Equilibria for Non-quasilinear Bidders in Combinatorial Auctions.
Proceedings of the Web and Internet Economics - 12th International Conference, 2016

2015
Secretary Problems with Non-Uniform Arrival Order.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

2014
Corrigendum to "ISI sparse channel estimation based on SL0 and its application in ML sequence-by-sequence equalization" [Signal Processing 92 (2012) 1875-1885].
Signal Process., 2014

Simple and Near-Optimal Mechanisms for Market Intermediation.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014

2013
Implementation and optimization of Wavelet modulation in Additive Gaussian channels.
CoRR, 2013

A Unified Approach to Online Allocation Algorithms via Randomized Dual Fitting.
CoRR, 2013

Sparse Channel Estimation by Factor Graphs.
CoRR, 2013

2012
On the Achievability of Cramér-Rao Bound in Noisy Compressed Sensing.
IEEE Trans. Signal Process., 2012

ISI sparse channel estimation based on SL0 and its application in ML sequence-by-sequence equalization.
Signal Process., 2012

2010
Adaptive and Non-adaptive ISI Sparse Channel Estimation Based on SL0 and Its Application in ML Sequence-by-Sequence Equalization.
Proceedings of the Latent Variable Analysis and Signal Separation, 2010

An Alternating Minimization Method for Sparse Channel Estimation.
Proceedings of the Latent Variable Analysis and Signal Separation, 2010


  Loading...