Nihar B. Shah

Proc. ACM Meas. Anal. Comput. Syst., March, 2023

The Square Root Agreement Rule for Incentivizing Truthful Feedback on Online Platforms.

[BibT_eX]

[DOI]

Manag. Sci., January, 2023

Peer Reviews of Peer Reviews: A Randomized Controlled Trial and Other Experiments.

[BibT_eX]

[DOI]

CoRR, 2023

Testing for Reviewer Anchoring in Peer Review: A Randomized Controlled Trial.

[BibT_eX]

[DOI]

CoRR, 2023

ReviewerGPT? An Exploratory Study on Using Large Language Models for Paper Reviewing.

[BibT_eX]

[DOI]

Ryan Liu

CoRR, 2023

A Gold Standard Dataset for the Reviewer Assignment Problem.

[BibT_eX]

[DOI]

CoRR, 2023

Assisting Human Decisions in Document Matching.

[BibT_eX]

[DOI]

CoRR, 2023

The Role of Author Identities in Peer Review.

[BibT_eX]

[DOI]

CoRR, 2023

A Dataset on Malicious Paper Bidding in Peer Review.

[BibT_eX]

[DOI]

Proceedings of the ACM Web Conference 2023, 2023

Counterfactual Evaluation of Peer-Review Assignment Policies.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022

Integrating Rankings into Quantized Scores in Peer Review.

[BibT_eX]

[DOI]

Trans. Mach. Learn. Res., 2022

Addendum and Erratum to "The MDS Queue: Analysing the Latency Performance of Erasure Codes".

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Two-Sample Testing on Ranked Preference Data and the Role of Modeling Assumptions.

[BibT_eX]

[DOI]

Charvi Rastogi

J. Mach. Learn. Res., 2022

How do Authors' Perceptions of their Papers Compare with Co-authors' Perceptions and Peer-review Decisions?

[BibT_eX]

[DOI]

Jennifer Wortman Vaughan

CoRR, 2022

Tradeoffs in Preventing Manipulation in Paper Bidding for Reviewer Assignment.

[BibT_eX]

[DOI]

CoRR, 2022

To ArXiv or not to ArXiv: A Study Quantifying Pros and Cons of Posting Preprints Online.

[BibT_eX]

[DOI]

CoRR, 2022

Cite-seeing and Reviewing: A Study on Citation Bias in Peer Review.

[BibT_eX]

[DOI]

CoRR, 2022

The Price of Strategyproofing Peer Assessment.

[BibT_eX]

[DOI]

CoRR, 2022

Challenges, experiments, and computational solutions in peer review.

[BibT_eX]

[DOI]

Commun. ACM, 2022

No Rose for MLE: Inadmissibility of MLE for Evaluation Aggregation Under Levels of Expertise.

[BibT_eX]

[DOI]

Charvi Rastogi

Proceedings of the IEEE International Symposium on Information Theory, 2022

Calibration with Privacy in Peer Review.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Near-Optimal Reviewer Splitting in Two-Phase Paper Reviewing and Conference Experiment Design.

[BibT_eX]

[DOI]

Proceedings of the Tenth AAAI Conference on Human Computation and Crowdsourcing, 2022

Strategyproofing Peer Assessment via Partitioning: The Price in Terms of Evaluators' Expertise.

[BibT_eX]

[DOI]

Proceedings of the Tenth AAAI Conference on Human Computation and Crowdsourcing, 2022

Allocation Schemes in Analytic Evaluation: Applicant-Centric Holistic or Attribute-Centric Segmented?

[BibT_eX]

[DOI]

Carmel Baharav

Anita Williams Woolley

R. Ravi

Proceedings of the Tenth AAAI Conference on Human Computation and Crowdsourcing, 2022

2021

A Permutation-Based Model for Crowd Labeling: Optimal Estimation and Robustness.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Prior and Prejudice: The Novice Reviewers' Bias against Resubmissions in Conference Peer Review.

[BibT_eX]

[DOI]

Proc. ACM Hum. Comput. Interact., 2021

PeerReview4All: Fair and Accurate Reviewer Assignment in Peer Review.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2021

Loss Functions, Axioms, and Peer Review.

[BibT_eX]

[DOI]

Ritesh Noothigattu

Ariel D. Procaccia

J. Artif. Intell. Res., 2021

WSDM 2021 Tutorial on Systematic Challenges and Computational Solutions on Bias and Unfairness in Peer Review.

[BibT_eX]

[DOI]

Proceedings of the WSDM '21, 2021

A heuristic for statistical seriation.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, 2021

KDD 2021 Tutorial on Systemic Challenges and Solutions on Bias and Unfairness in Peer Review.

[BibT_eX]

[DOI]

Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

JCDL 2021 Tutorial on Systemic Challenges and Computational Solutions on Bias and Unfairness in Peer Review.

[BibT_eX]

[DOI]

Proceedings of the ACM/IEEE Joint Conference on Digital Libraries, 2021

A Novice-Reviewer Experiment to Address Scarcity of Qualified Reviewers in Large Conferences.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Catch Me if I Can: Detecting Strategic Behaviour in Peer Assessment.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Uncovering Latent Biases in Text: Method and Application to Peer Review.

[BibT_eX]

[DOI]

Emaad A. Manzoor

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Debiasing Evaluations That Are Biased by Evaluations.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Approval Voting and Incentives in Crowdsourcing.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2020

A Large Scale Randomized Controlled Trial on Herding in Peer-Review Discussions.

[BibT_eX]

[DOI]

CoRR, 2020

A SUPER<sup>*</sup> Algorithm to Optimize Paper Bidding in Peer Review.

[BibT_eX]

[DOI]

Tanner Fiez

Lillian J. Ratliff

CoRR, 2020

On the Privacy-Utility Tradeoff in Peer-Review Data Analysis.

[BibT_eX]

[DOI]

Wenxin Ding

Weina Wang

CoRR, 2020

A SUPER* Algorithm to Optimize Paper Bidding in Peer Review.

[BibT_eX]

[DOI]

Tanner Fiez

Lillian J. Ratliff

Proceedings of the Thirty-Sixth Conference on Uncertainty in Artificial Intelligence, 2020

SIGMOD 2020 Tutorial on Fairness and Bias in Peer Review and Other Sociotechnical Intelligent Systems.

[BibT_eX]

[DOI]

Zachary C. Lipton

Proceedings of the 2020 International Conference on Management of Data, 2020

Mitigating Manipulation in Peer Review via Randomized Reviewer Assignments.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Two-Sample Testing on Pairwise Comparison Data and the Role of Modeling Assumptions.

[BibT_eX]

[DOI]

Charvi Rastogi

Proceedings of the IEEE International Symposium on Information Theory, 2020

Stretching the Effectiveness of MLE from Accuracy to Bias for Pairwise Comparisons.

[BibT_eX]

[DOI]

R. Ravi

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

Ranking and Rating Rankings and Ratings.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Feeling the Bern: Adaptive Estimators for Bernoulli Probabilities of Pairwise Comparisons.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Low Permutation-rank Matrices: Structural Properties and Noisy Completion.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2019

On Testing for Biases in Peer Review.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

On Strategyproof Conference Peer Review.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Your 2 is My 1, Your 3 is My 9: Handling Arbitrary Miscalibrations in Ratings.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018

Information-Theoretically Secure Erasure Codes for Distributed Storage.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Design and Analysis of the NIPS 2016 Review Process.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2018

Parametric Prediction from Parametric Agents.

[BibT_eX]

[DOI]

Oper. Res., 2018

An Incentive Mechanism for Crowd Sensing with Colluding Agents.

[BibT_eX]

[DOI]

CoRR, 2018

Choosing How to Choose Papers.

[BibT_eX]

[DOI]

Ritesh Noothigattu

Ariel D. Procaccia

CoRR, 2018

2017

Learning From People.

[BibT_eX]

[DOI]

Nihar Bhadresh Shah

PhD thesis, 2017

Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues.

[BibT_eX]

[DOI]

Adityanand Guntuboyina

IEEE Trans. Inf. Theory, 2017

A Piggybacking Design Framework for Read-and Download-Efficient Distributed Storage Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

The MDS Queue: Analysing the Latency Performance of Erasure Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Simple, Robust and Optimal Ranking from Pairwise Comparisons.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2017

2016

When Do Redundant Requests Reduce Latency?

[BibT_eX]

[DOI]

Kangwook Lee

IEEE Trans. Commun., 2016

Double or Nothing: Multiplicative Incentive Mechanisms for Crowdsourcing.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2016

Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2016

Active Ranking from Pairwise Comparisons and the Futility of Parametric Assumptions.

[BibT_eX]

[DOI]

CoRR, 2016

No Oops, You Won't Do It Again: Mechanisms for Self-correction in Crowdsourcing.

[BibT_eX]

[DOI]

Proceedings of the 33nd International Conference on Machine Learning, 2016

Overcoming Calibration Problems in Pattern Labeling with Pairwise Ratings: Application to Personality Traits.

[BibT_eX]

[DOI]

Proceedings of the Computer Vision - ECCV 2016 Workshops, 2016

2015

Distributed Secret Dissemination Across a Network.

[BibT_eX]

[DOI]

IEEE J. Sel. Top. Signal Process., 2015

Regularized Minimax Conditional Entropy for Crowdsourcing.

[BibT_eX]

[DOI]

CoRR, 2015

Truth Serums for Massively Crowdsourced Evaluation Tasks.

[BibT_eX]

[DOI]

CoRR, 2015

Double or Nothing: Multiplicative Incentive Mechanisms for Crowdsourcing.

[BibT_eX]

[DOI]

Nihar Bhadresh Shah

Denny Zhou

Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Approval Voting and Incentives in Crowdsourcing.

[BibT_eX]

[DOI]

Yuval Peres

Proceedings of the 32nd International Conference on Machine Learning, 2015

Having Your Cake and Eating It Too: Jointly Optimal Erasure Codes for I/O, Storage, and Network-bandwidth.

[BibT_eX]

[DOI]

Proceedings of the 13th USENIX Conference on File and Storage Technologies, 2015

On the Impossibility of Convex Inference in Human Computation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

When is it Better to Compare than to Score?

[BibT_eX]

[DOI]

CoRR, 2014

A "hitchhiker's" guide to fast and efficient data reconstruction in erasure-coded data centers.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGCOMM 2014 Conference, 2014

One extra bit of download ensures perfectly private information retrieval.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

The MDS queue: Analysing the latency performance of erasure codes.

[BibT_eX]

[DOI]

Kangwook Lee

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Optimality of the product-matrix construction for secure MSR regenerating codes.

[BibT_eX]

[DOI]

Proceedings of the 6th International Symposium on Communications, 2014

Fundamental limits on communication for oblivious updates in storage networks.

[BibT_eX]

[DOI]

Preetum Nakkiran

Proceedings of the IEEE Global Communications Conference, 2014

2013

On Minimizing Data-Read and Download for Storage-Node Recovery.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2013

Secure network coding for distributed secret sharing with low communication cost.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

A Solution to the Network Challenges of Data Recovery in Erasure-coded Distributed Storage Systems: A Study on the Facebook Warehouse Cluster.

[BibT_eX]

[DOI]

Proceedings of the 5th USENIX Workshop on Hot Topics in Storage and File Systems, 2013

2012

Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

On Minimizing Disk-read and Download for Storage-Node Recovery

[BibT_eX]

[DOI]

CoRR, 2012

The MDS Queue

[BibT_eX]

[DOI]

Kangwook Lee

CoRR, 2012

Secret Share Dissemination across a Network

[BibT_eX]

[DOI]

CoRR, 2012

Regenerating codes for errors and erasures in distributed storage.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction.

[BibT_eX]

[DOI]

Korlakai Vinayak Rashmi

IEEE Trans. Inf. Theory, 2011

Enabling node repair in any erasure code for distributed storage.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Information-Theoretically Secure Regenerating Codes for Distributed Storage.

[BibT_eX]

[DOI]

Proceedings of the Global Communications Conference, 2011

2010

Distributed Storage Codes with Repair-by-Transfer and Non-achievability of Interior Points on the Storage-Bandwidth Tradeoff

[BibT_eX]

[DOI]

CoRR, 2010

The MISER Code: An MDS Distributed Storage Code that Minimizes Repair Bandwidth for Systematic Nodes through Interference Alignment

[BibT_eX]

[DOI]

CoRR, 2010

Regenerating Codes for Distributed Storage Networks.

[BibT_eX]

[DOI]

Proceedings of the Arithmetic of Finite Fields, Third International Workshop, 2010

Explicit and optimal codes for distributed storage.

[BibT_eX]

[DOI]

Proceedings of the Information Theory and Applications Workshop, 2010

A flexible class of regenerating codes for distributed storage.

[BibT_eX]

[DOI]