Fetching the paper…
Reading the bibliography…
Many scientific conferences employ a two-phase paper review process, where some papers are assigned additional reviewers after the initial reviews are submitted.
A remark on Stirling’s formula
Herbert Robbins · 1955
Earlier work this paper cites.
Reducibility among combinatorial problems
Richard M. Karp · 1972
Earlier work this paper cites.
Unintelligible management research and academic prestige
J. Scott Armstrong · 1980
Earlier work this paper cites.
Peer review: A study of reliability
Stephen J. Ceci and Douglas P. Peters · 1982
Earlier work this paper cites.
An optimal algorithm for online bipartite matching
Richard M. Karp, Umesh V. Vazirani, and Vijay V. Vazirani · 1990
Earlier work this paper cites.
Asymptotic theory for solutions in statistical estimation and stochastic programming
Alan J. King and R. Tyrrell Rockafellar · 1993
Earlier work this paper cites.
Probability inequalities for sums of bounded random variables
Wassily Hoeffding · 1994
Earlier work this paper cites.
Convergence properties of two-stage stochastic programming
Liyi Dai, Ching-Hua Chen, and John R. Birge · 2000
Earlier work this paper cites.
A factor 1/2 approximation algorithm for two-stage stochastic matching problems
Nan Kong and Andrew J. Schaefer · 2006
Earlier work this paper cites.
Impact of double-blind reviewing on SIGMOD publication rates
Samuel Madden and David DeWitt · 2006
Earlier work this paper cites.
Impact of double blind reviewing on SIGMOD publication: A more detailed analysis
Anthony K.H. Tung · 2006
Earlier work this paper cites.
Expertise modeling for matching papers with reviewers
David Mimno and Andrew McCallum · 2007
Earlier work this paper cites.
The AI conference paper assignment problem
Judy Goldsmith and Robert H. Sloan · 2007
Earlier work this paper cites.
Multi-aspect expertise matching for review assignment
Maryam Karimzadehgan, ChengXiang Zhai, and Geneva Belford · 2008
Earlier work this paper cites.
An algorithm to determine peer-reviewers
Marko A. Rodriguez and Johan Bollen · 2008
Earlier work this paper cites.
On the optimal assignment of conference papers to reviewers
Camillo J. Taylor · 2008
Earlier work this paper cites.
Commitment under uncertainty: Two-stage stochastic matching problems
Irit Katriel, Claire Kenyon-Mathieu, and Eli Upfal · 2008
Earlier work this paper cites.
Online stochastic matching: Beating 1-1/e
Jon Feldman, Aranyak Mehta, Vahab Mirrokni, and Shan Muthukrishnan · 2009
Earlier work this paper cites.
Implementing random assignments: A generalization of the Birkhoff-von Neumann theorem
Eric Budish, Yeon-Koo Che, Fuhito Kojima, and Paul Milgrom · 2009
Earlier work this paper cites.
Expertise matching via constraint-based optimization
Wenbin Tang, Jie Tang, and Chenhao Tan · 2010
Earlier work this paper cites.
Novel tools to streamline the conference review process: Experiences from SIGKDD’09
Peter A. Flach, Sebastian Spiegler, Bruno Golénia, Simon Price, John Guiver, Ralf Herbrich, Thore Graepel, and Mohammed J. Zaki · 2010
Earlier work this paper cites.
Assigning papers to referees
Naveen Garg, Telikepalli Kavitha, Amit Kumar, Kurt Mehlhorn, and Julián Mestre · 2010
Earlier work this paper cites.
Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, and Olivier Spanjaard · 2010
Cited alongside, same era.
Lower bounds for testing function isomorphism
Eric Blais and Ryan O’Donnell · 2010
Cited alongside, same era.
Sum of us: Strategyproof selection from the selectors
Noga Alon, Felix Fischer, Ariel Procaccia, and Moshe Tennenholtz · 2011
Cited alongside, same era.
A framework for optimizing paper matching
Laurent Charlin, Richard Zemel, and Craig Boutilier · 2011
Cited alongside, same era.
Submodular maximization by simulated annealing
Shayan Oveis Gharan and Jan Vondrák · 2011
Cited alongside, same era.
Maximizing non-monotone submodular functions
Uriel Feige, Vahab S. Mirrokni, and Jan Vondrák · 2011
Cited alongside, same era.
PeerReview4All: Fair and accurate reviewer assignment in peer review
Ivan Stelmakh, Nihar Shah, and Aarti Singh · 2019
Later among the works it cites.
Paper matching with local fairness constraints
Ari Kobren, Barna Saha, and Andrew McCallum · 2019
Later among the works it cites.
Strategyproof peer selection using randomization, partitioning, and apportionment
Haris Aziz, Omer Lev, Nicholas Mattei, Jeffrey S. Rosenschein, and Toby Walsh · 2019
Later among the works it cites.
Do experts listen to other experts? Field experimental evidence from peer review
Misha Teplitskiy, Hardeep Ranu, Gary Gray, Michael Menietti, Eva Guinan, and Karim R. Lakhani · 2019
Later among the works it cites.
The distributed peer review experiment
Ferdinando Patat, Wolfgang Kerzendorf, Dominic Bordelon, Glen Van de Ven, and Tyler Pritchard · 2019
Later among the works it cites.
On testing for biases in peer review
Ivan Stelmakh, Nihar B. Shah, and Aarti Singh · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Dynamic matching via weighted myopia with application to kidney exchange
John P. Dickerson, Ariel D. Procaccia, and Tuomas Sandholm · 2012
Cited alongside, same era.
PrefLib: A library of preference data http://preflib.org
Nicholas Mattei and Toby Walsh · 2013
Cited alongside, same era.
The Toronto Paper Matching System: An automated paper-reviewer assignment system
Laurent Charlin and Richard S. Zemel · 2013
Cited alongside, same era.
Capitalizing on order effects in the bids of peer-reviewed conferences to secure reviews by expert referees
Guillaume Cabanac and Thomas Preuss · 2013
Cited alongside, same era.
On good and fair paper-reviewer assignment
Cheng Long, Raymond Wong, Yu Peng, and Liangliang Ye · 2013
Cited alongside, same era.
A robust model for paper reviewer assignment
Xiang Liu, Torsten Suel, and Nasir Memon · 2014
Cited alongside, same era.
Later among the works it cites.
Statistical aspects of Wasserstein distances
Victor M. Panaretos and Yoav Zemel · 2019
Later among the works it cites.
Generalized assignment via submodular optimization with reserved capacity
Ariel Kulik, Kanthi Sarpatwar, Baruch Schieber, and Hadas Shachnai · 2019
Later among the works it cites.
A market-inspired bidding scheme for peer review paper assignment
Reshef Meir, Jérôme Lang, Julien Lesca, Natan Kaminsky, and Nicholas Mattei · 2020
Later among the works it cites.
A SUPER* algorithm to optimize paper bidding in peer review
Tanner Fiez, Nihar Shah, and Lillian Ratliff · 2020
Later among the works it cites.
Mitigating manipulation in peer review via randomized reviewer assignments
Steven Jecmen, Hanrui Zhang, Ryan Liu, Nihar B. Shah, Vincent Conitzer, and Fei Fang · 2020
Later among the works it cites.
Maximum matching in the online batch-arrival model
Euiwoong Lee and Sahil Singla · 2020
Later among the works it cites.
A large scale randomized controlled trial on herding in peer-review discussions
Ivan Stelmakh, Charvi Rastogi, Nihar B. Shah, Aarti Singh, and Hal Daumé III · 2020
Later among the works it cites.
The NIPS experiment
Eric Price · 2021
Closest in time.
The NIPS experiment
Neil D. Lawrence · 2021
Closest in time.
Two-stage stochastic matching with application to ride hailing
Yiding Feng, Rad Niazadeh, and Amin Saberi · 2021
Closest in time.
Prior and prejudice: The novice reviewers’ bias against resubmissions in conference peer review
Ivan Stelmakh, Nihar B. Shah, Aarti Singh, and Hal Daumé III · 2021
Closest in time.
Catch me if I can: Detecting strategic behaviour in peer assessment
Ivan Stelmakh, Nihar B. Shah, and Aarti Singh · 2021
Closest in time.
Uncovering latent biases in text: Method and application to peer review
Emaad Manzoor and Nihar B. Shah · 2021
Closest in time.
Systemic challenges and solutions on bias and unfairness in peer review
Nihar B. Shah · 2021
Closest in time.
OpenReview explorer
Horace He · 2021
Closest in time.
Gurobi Optimizer reference manual, 2021
Gurobi Optimization LLC · 2021
Closest in time.