default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRad Niazadeh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Yiding Feng, Rad Niazadeh
, Amin Saberi:
Two-Stage Stochastic Matching and Pricing with Applications to Ride Hailing. Oper. Res. 72(4): 1574-1594 (2024)- [j18]Yiding Feng, Rad Niazadeh, Amin Saberi:
Technical Note - Near-Optimal Bayesian Online Assortment of Reusable Resources. Oper. Res. 72(5): 1861-1873 (2024) - [j17]Ozan Candogan, Chen Chen, Rad Niazadeh:
Correlated Cluster-Based Randomized Experiments: Robust Variance Minimization. Manag. Sci. 70(6): 4069-4086 (2024) - [j16]Yuval Emek, Ron Lavi, Rad Niazadeh, Yangguang Shi:
Stateful Posted Pricing with Vanishing Regret via Dynamic Deterministic Markov Decision Processes. Math. Oper. Res. 49(2): 880-900 (2024) - [j15]Steven Delong, Alireza Farhadi, Rad Niazadeh, Balasubramanian Sivan, Rajan Udwani:
Online Bipartite Matching with Reusable Resources. Math. Oper. Res. 49(3): 1825-1854 (2024) - [j14]Rad Niazadeh, Renato Paes Leme, Jon Schneider:
Bernoulli Factories for Flow-Based Polytopes. SIAM J. Discret. Math. 38(1): 726-742 (2024) - [c32]Negin Golrezaei, Rad Niazadeh, Kumar Kshitij Patel, Fransisca Susan:
Online Combinatorial Optimization with Group Fairness Constraints. IJCAI 2024: 394-402 - [c31]Farbod Ekbatani, Rad Niazadeh, Pranav Nuti, Jan Vondrák:
Prophet Inequalities with Cancellation Costs. STOC 2024: 1247-1258 - [i33]Arpit Agarwal, Rad Niazadeh, Prathamesh Patil:
Misalignment, Learning, and Ranking: Harnessing Users Limited Attention. CoRR abs/2402.14013 (2024) - [i32]Farbod Ekbatani, Rad Niazadeh, Pranav Nuti, Jan Vondrák:
Prophet Inequalities with Cancellation Costs. CoRR abs/2404.00527 (2024) - 2023
- [j13]Arash Asadpour, Rad Niazadeh, Amin Saberi, Ali Shameli:
Sequential Submodular Maximization and Applications to Ranking an Assortment of Products. Oper. Res. 71(4): 1154-1170 (2023) - [j12]Rad Niazadeh, Negin Golrezaei, Joshua R. Wang, Fransisca Susan, Ashwinkumar Badanidiyuru:
Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization. Manag. Sci. 69(7): 3797-3817 (2023) - [j11]Vahideh H. Manshadi, Rad Niazadeh, Scott Rodilitz:
Fair Dynamic Rationing. Manag. Sci. 69(11): 6818-6836 (2023) - [c30]Ozan Candogan, Chen Chen, Rad Niazadeh:
Correlated Cluster-Based Randomized Experiments: Robust Variance Minimization. EC 2023: 411 - [c29]Farbod Ekbatani, Yiding Feng, Rad Niazadeh:
Online Resource Allocation with Buyback: Optimal Algorithms via Primal-Dual. EC 2023: 583 - 2022
- [j10]Rad Niazadeh, Jason D. Hartline, Nicole Immorlica, Mohammad Reza Khani, Brendan Lucier:
Fast Core Pricing for Rich Advertising Auctions. Oper. Res. 70(1): 223-240 (2022) - [c28]Saeed Alaei, Ali Makhdoumi, Azarakhsh Malekian, Rad Niazadeh:
Descending Price Auctions with Bounded Number of Price Levels and Batched Prophet Inequality. EC 2022: 246 - [c27]Arash Asadpour, Rad Niazadeh, Amin Saberi, Ali Shameli:
Sequential Submodular Maximization and Applications to Ranking an Assortment of Products. EC 2022: 817 - [c26]Steven Delong, Alireza Farhadi, Rad Niazadeh, Balasubramanian Sivan:
Online Bipartite Matching with Reusable Resources. EC 2022: 962-963 - [c25]Yiding Feng, Rad Niazadeh, Amin Saberi:
Near-Optimal Bayesian Online Assortment of Reusable Resources. EC 2022: 964-965 - [i31]Saeed Alaei, Ali Makhdoumi, Azarakhsh Malekian, Rad Niazadeh:
Descending Price Auctions with Bounded Number of Price Levels and Batched Prophet Inequality. CoRR abs/2203.01384 (2022) - [i30]Rad Niazadeh, Renato Paes Leme, Jon Schneider:
Bernoulli Factories for Flow-Based Polytopes. CoRR abs/2207.08965 (2022) - [i29]Farbod Ekbatani, Yiding Feng, Rad Niazadeh:
Online Resource Allocation with Buyback: Optimal Algorithms via Primal-Dual. CoRR abs/2210.11570 (2022) - [i28]Yiding Feng, Rad Niazadeh, Amin Saberi:
Two-stage Stochastic Matching and Pricing with Applications to Ride Hailing. CoRR abs/2210.11648 (2022) - [i27]Yiding Feng, Rad Niazadeh:
Batching and Optimal Multi-stage Bipartite Allocations. CoRR abs/2211.16581 (2022) - 2021
- [j9]Shaddin Dughmi, Jason D. Hartline, Robert D. Kleinberg, Rad Niazadeh:
Bernoulli Factories and Black-box Reductions in Mechanism Design. J. ACM 68(2): 10:1-10:30 (2021) - [c24]Yiding Feng, Rad Niazadeh:
Batching and Optimal Multi-Stage Bipartite Allocations (Extended Abstract). ITCS 2021: 88:1-88:1 - [c23]Vahideh H. Manshadi, Rad Niazadeh, Scott Rodilitz:
Fair Dynamic Rationing. EC 2021: 694-695 - [c22]Rad Niazadeh, Negin Golrezaei, Joshua R. Wang, Fransisca Susan, Ashwinkumar Badanidiyuru:
Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization. EC 2021: 737-738 - [c21]Yiding Feng, Rad Niazadeh, Amin Saberi:
Two-stage Stochastic Matching with Application to Ride Hailing. SODA 2021: 2862-2877 - [c20]Rad Niazadeh, Renato Paes Leme, Jon Schneider:
Combinatorial Bernoulli factories: matchings, flows, and other polytopes. STOC 2021: 833-846 - [i26]Vahideh H. Manshadi, Rad Niazadeh, Scott Rodilitz:
Fair Dynamic Rationing. CoRR abs/2102.01240 (2021) - [i25]Rad Niazadeh, Negin Golrezaei, Joshua R. Wang, Fransisca Susan, Ashwinkumar Badanidiyuru:
Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization. CoRR abs/2102.11050 (2021) - [i24]Steven Delong, Alireza Farhadi, Rad Niazadeh, Balasubramanian Sivan:
Online Bipartite Matching with Reusable Resources. CoRR abs/2110.07084 (2021) - 2020
- [j8]Rad Niazadeh, Tim Roughgarden, Joshua R. Wang:
Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization. J. Mach. Learn. Res. 21: 125:1-125:31 (2020) - [c19]Yuval Emek, Ron Lavi, Rad Niazadeh, Yangguang Shi:
Stateful Posted Pricing with Vanishing Regret via Dynamic Deterministic Markov Decision Processes. NeurIPS 2020 - [i23]Arash Asadpour, Rad Niazadeh, Amin Saberi, Ali Shameli:
Ranking an Assortment of Products via Sequential Submodular Optimization. CoRR abs/2002.09458 (2020) - [i22]Yuval Emek, Shay Kutten, Ron Lavi, Rad Niazadeh, Yangguang Shi:
No-Regret Stateful Posted Pricing. CoRR abs/2005.01869 (2020) - [i21]Rad Niazadeh, Renato Paes Leme, Jon Schneider:
Combinatorial Bernoulli Factories: Matchings, Flows and Other Polytopes. CoRR abs/2011.03865 (2020)
2010 – 2019
- 2019
- [j7]Saeed Alaei, Jason D. Hartline, Rad Niazadeh, Emmanouil Pountourakis, Yang Yuan:
Optimal auctions vs. anonymous pricing. Games Econ. Behav. 118: 494-510 (2019) - [j6]Sébastien Bubeck, Nikhil R. Devanur, Zhiyi Huang, Rad Niazadeh:
Multi-scale Online Learning: Theory and Applications to Online Auctions and Pricing. J. Mach. Learn. Res. 20: 62:1-62:37 (2019) - [c18]Moses Charikar, Vaggos Chatziafratis, Rad Niazadeh, Grigory Yaroslavtsev:
Hierarchical Clustering for Euclidean Data. AISTATS 2019: 2721-2730 - [c17]Nima Anari, Rad Niazadeh, Amin Saberi, Ali Shameli:
Nearly Optimal Pricing Algorithms for Production Constrained and Laminar Bayesian Selection. EC 2019: 91-92 - [c16]Moses Charikar, Vaggos Chatziafratis, Rad Niazadeh:
Hierarchical Clustering better than Average-Linkage. SODA 2019: 2291-2304 - [c15]Shaddin Dughmi, Rad Niazadeh, Alexandros Psomas, S. Matthew Weinberg:
Persuasion and Incentives Through the Lens of Duality. WINE 2019: 142-155 - [i20]Shaddin Dughmi, Rad Niazadeh, Alexandros Psomas, S. Matthew Weinberg:
Persuasion and Incentives Through the Lens of Duality. CoRR abs/1909.10584 (2019) - 2018
- [c14]Vaggos Chatziafratis, Rad Niazadeh, Moses Charikar:
Hierarchical Clustering with Structural Constraints. ICML 2018: 773-782 - [c13]Rad Niazadeh, Tim Roughgarden, Joshua R. Wang:
Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization. NeurIPS 2018: 9617-9627 - [c12]Jason D. Hartline, Nicole Immorlica, Mohammad Reza Khani, Brendan Lucier, Rad Niazadeh:
Fast Core Pricing for Rich Advertising Auctions. EC 2018: 111-112 - [c11]Rad Niazadeh, Amin Saberi, Ali Shameli:
Prophet Inequalities vs. Approximating Optimum Online. WINE 2018: 356-374 - [i19]Vaggos Chatziafratis, Rad Niazadeh, Moses Charikar:
Hierarchical Clustering with Structural Constraints. CoRR abs/1805.09476 (2018) - [i18]Rad Niazadeh, Tim Roughgarden, Joshua R. Wang:
Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization. CoRR abs/1805.09480 (2018) - [i17]Nima Anari, Rad Niazadeh, Amin Saberi, Ali Shameli:
Nearly Optimal Pricing Algorithms for Production Constrained and Laminar Bayesian Selection. CoRR abs/1807.05477 (2018) - [i16]Moses Charikar, Vaggos Chatziafratis, Rad Niazadeh:
Hierarchical Clustering better than Average-Linkage. CoRR abs/1808.02227 (2018) - [i15]Moses Charikar, Vaggos Chatziafratis, Rad Niazadeh, Grigory Yaroslavtsev:
Hierarchical Clustering for Euclidean Data. CoRR abs/1812.10582 (2018) - 2017
- [b1]Rad Niazadeh:
Algorithms vs. Mechanisms: Mechanism Design for Complex Environments. Cornell University, USA, 2017 - [j5]Rad Niazadeh:
Algorithms versus mechanisms: how to cope with strategic input? XRDS 24(1): 20-23 (2017) - [j4]Shaddin Dughmi, Jason D. Hartline, Robert Kleinberg, Rad Niazadeh:
Bernoulli factories and black-box reductions in mechanism design. SIGecom Exch. 16(1): 58-71 (2017) - [c10]Shuchi Chawla, Nikhil R. Devanur, Janardhan Kulkarni, Rad Niazadeh:
Truth and Regret in Online Scheduling. EC 2017: 423-440 - [c9]Sébastien Bubeck, Nikhil R. Devanur, Zhiyi Huang, Rad Niazadeh:
Online Auctions and Multi-scale Online Learning. EC 2017: 497-514 - [c8]Shaddin Dughmi, Jason D. Hartline, Robert Kleinberg, Rad Niazadeh:
Bernoulli factories and black-box reductions in mechanism design. STOC 2017: 158-169 - [c7]Christopher A. Wilkens, Ruggiero Cavallo, Rad Niazadeh:
GSP: The Cinderella of Mechanism Design. WWW 2017: 25-32 - [i14]Christopher A. Wilkens, Ruggiero Cavallo, Rad Niazadeh:
GSP - The Cinderella of Mechanism Design. CoRR abs/1701.05946 (2017) - [i13]Shuchi Chawla, Nikhil R. Devanur, Janardhan Kulkarni, Rad Niazadeh:
Truth and Regret in Online Scheduling. CoRR abs/1703.00484 (2017) - [i12]Shaddin Dughmi, Jason D. Hartline, Robert D. Kleinberg, Rad Niazadeh:
Bernoulli Factories and Black-Box Reductions in Mechanism Design. CoRR abs/1703.04143 (2017) - [i11]Sébastien Bubeck, Nikhil R. Devanur, Zhiyi Huang, Rad Niazadeh:
Online Auctions and Multi-scale Online Learning. CoRR abs/1705.09700 (2017) - 2016
- [c6]Rad Niazadeh, Christopher A. Wilkens:
Competitive Equilibria for Non-quasilinear Bidders in Combinatorial Auctions. WINE 2016: 116-130 - [i10]Rad Niazadeh, Christopher A. Wilkens:
Competitive Equilibria for Non-quasilinear Bidders in Combinatorial Auctions. CoRR abs/1606.06846 (2016) - [i9]Christopher A. Wilkens, Ruggiero Cavallo, Rad Niazadeh:
Mechanism Design for Value Maximizers. CoRR abs/1607.04362 (2016) - [i8]Jason D. Hartline, Nicole Immorlica, Brendan Lucier, Rad Niazadeh:
Finding Bidder-Optimal Core Points Quickly. CoRR abs/1610.03564 (2016) - 2015
- [c5]Saeed Alaei, Jason D. Hartline, Rad Niazadeh, Emmanouil Pountourakis, Yang Yuan:
Optimal Auctions vs. Anonymous Pricing. FOCS 2015: 1446-1463 - [c4]Thomas Kesselheim, Robert D. Kleinberg, Rad Niazadeh:
Secretary Problems with Non-Uniform Arrival Order. STOC 2015: 879-888 - [i7]Thomas Kesselheim, Robert D. Kleinberg, Rad Niazadeh:
Secretary Problems with Non-Uniform Arrival Order. CoRR abs/1502.02155 (2015) - [i6]Saeed Alaei, Jason D. Hartline, Rad Niazadeh, Emmanouil Pountourakis, Yang Yuan:
Optimal Auctions vs. Anonymous Pricing. CoRR abs/1507.02615 (2015) - 2014
- [j3]Rad Niazadeh, Sina Hamidi Ghalehjegh, Massoud Babaie-Zadeh, Christian Jutten:
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. 94: 703 (2014) - [c3]Rad Niazadeh, Yang Yuan, Robert D. Kleinberg:
Simple and Near-Optimal Mechanisms for Market Intermediation. WINE 2014: 386-399 - [i5]Rad Niazadeh, Yang Yuan, Robert D. Kleinberg:
Simple and Near-Optimal Mechanisms For Market Intermediation. CoRR abs/1409.2597 (2014) - 2013
- [i4]Rad Niazadeh, Robert D. Kleinberg:
A Unified Approach to Online Allocation Algorithms via Randomized Dual Fitting. CoRR abs/1308.5444 (2013) - [i3]Rad Niazadeh, Massoud Babaie-Zadeh, Christian Jutten:
Sparse Channel Estimation by Factor Graphs. CoRR abs/1308.5597 (2013) - [i2]Rad Niazadeh, Sahar Nassirpour, Mohammad B. Shamsollahi:
Implementation and optimization of Wavelet modulation in Additive Gaussian channels. CoRR abs/1308.6251 (2013) - 2012
- [j2]Rad Niazadeh, Sina Hamidi Ghalehjegh, Massoud Babaie-Zadeh, Christian Jutten:
ISI sparse channel estimation based on SL0 and its application in ML sequence-by-sequence equalization. Signal Process. 92(8): 1875-1885 (2012) - [j1]Rad Niazadeh, Massoud Babaie-Zadeh, Christian Jutten:
On the Achievability of Cramér-Rao Bound in Noisy Compressed Sensing. IEEE Trans. Signal Process. 60(1): 518-526 (2012) - 2010
- [c2]Rad Niazadeh, Massoud Babaie-Zadeh, Christian Jutten:
An Alternating Minimization Method for Sparse Channel Estimation. LVA/ICA 2010: 319-327 - [c1]Rad Niazadeh, Sina Hamidi Ghalehjegh, Massoud Babaie-Zadeh, Christian Jutten:
Adaptive and Non-adaptive ISI Sparse Channel Estimation Based on SL0 and Its Application in ML Sequence-by-Sequence Equalization. LVA/ICA 2010: 579-587 - [i1]Rad Niazadeh, Massoud Babaie-Zadeh, Christian Jutten:
On the Achievability of Cramér-Rao Bound In Noisy Compressed Sensing. CoRR abs/1006.2513 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
