Fetching the paper…
Reading the bibliography…
We consider a crowdsourcing model in which $n$ workers are asked to rate the quality of $n$ items previously generated by other workers.
Stochastic blockmodels: Some first steps
P. W. Holland, K. B. Laskey, and S. Leinhardt · 1983
Earlier work this paper cites.
Finding and certifying a large hidden clique in a semirandom graph
U. Feige and R. Krauthgamer · 2000
Earlier work this paper cites.
Algorithms for graph partitioning on the planted partition model
A. Condon and R. M. Karp · 2001
Earlier work this paper cites.
Heuristics for semirandom graph problems
U. Feige and J. Kilian · 2001
Earlier work this paper cites.
Coloring semirandom graphs optimally
A. Coja-Oghlan · 2004
Earlier work this paper cites.
Amazon glitch unmasks war of reviewers
A. Harmon · 2004
Earlier work this paper cites.
The sample complexity of exploration in the multi-armed bandit problem
S. Mannor and J. N. Tsitsiklis · 2004
Earlier work this paper cites.
Eliciting informative feedback: The peer-prediction method
N. Miller, P. Resnick, and R. Zeckhauser · 2005
Earlier work this paper cites.
Semirandom models as benchmarks for coloring algorithms
M. Krivelevich and D. Vilenchik · 2006
Earlier work this paper cites.
Solving NP-hard semirandom graph problems in polynomial expected time
A. Coja-Oghlan · 2007
Earlier work this paper cites.
Creating, destroying, and restoring value in Wikipedia
R. Priedhorsky, J. Chen, S. T. K. Lam, K. Panciera, L. Terveen, and J. Riedl · 2007
Earlier work this paper cites.
The influence limiter: provably manipulation-resistant recommender systems
P. Resnick and R. Sami · 2007
Earlier work this paper cites.
ImageNet: A large-scale hierarchical image database
J. Deng, W. Dong, R. Socher, L. Li, K. Li, and L. Fei-Fei · 2009
Earlier work this paper cites.
Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
A. Decelle, F. Krzakala, C. Moore, and L. Zdeborová · 2011
Earlier work this paper cites.
How much spam can you take? An analysis of crowdsourcing results to increase accuracy
J. Vuurens, A. P. de Vries, and C. Eickhoff · 2011
Cited alongside, same era.
Approximation algorithms for semi-random partitioning problems
K. Makarychev, Y. Makarychev, and A. Vijayaraghavan · 2012
Cited alongside, same era.
Promotional reviews: An empirical investigation of online review manipulation
D. Mayzlin, Y. Dover, and J. A. Chevalier · 2012
Cited alongside, same era.
Stochastic block models and reconstruction
E. Mossel, J. Neeman, and A. Sly · 2012
Cited alongside, same era.
Crowdsourced judgement elicitation with endogenous proficiency
A. Dasgupta and A. Ghosh · 2013
Cited alongside, same era.
Tuned models of peer assessment in MOOCs
C. Piech, J. Huang, Z. Chen, C. Do, A. Ng, and D. Koller · 2013
Cited alongside, same era.
Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
T. T. Cai and X. Li · 2015
Later among the works it cites.
Stochastic block model and community detection in the sparse graphs: A spectral algorithm with optimal rate of recovery
P. Chin, A. Rao, and V. Vu · 2015
Later among the works it cites.
Truth serums for massively crowdsourced evaluation tasks
V. Kamble, N. Shah, D. Marn, A. Parekh, and K. Ramachandran · 2015
Later among the works it cites.
Peer and self assessment in massive online classes
C. Kulkarni, P. W. Koh, H. Huy, D. Chia, K. Papadopoulos, J. Cheng, D. Koller, and S. R. Klemmer · 2015
Later among the works it cites.
Concentration and regularization of random graphs
C. M. Le and R. Vershynin · 2015
Later among the works it cites.
Learning communities in the presence of errors
K. Makarychev, Y. Makarychev, and A. Vijayaraghavan · 2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Improved graph clustering
Y. Chen, S. Sanghavi, and H. Xu · 2014
Cited alongside, same era.
Provably manipulation-resistant reputation systems
P. Christiano · 2014
Cited alongside, same era.
Community detection in sparse networks via Grothendieck’s inequality
O. Guédon and R. Vershynin · 2014
Cited alongside, same era.
Budget-optimal task allocation for reliable crowdsourcing systems
D. R. Karger, S. Oh, and D. Shah · 2014
Cited alongside, same era.
Community detection thresholds and the weak Ramanujan property
L. Massoulié · 2014
Cited alongside, same era.
Spectral methods meet EM: A provably optimal algorithm for crowdsourcing
Y. Zhang, X. Chen, D. Zhou, and M. I. Jordan · 2014
Cited alongside, same era.
Later among the works it cites.
How robust are reconstruction thresholds for community detection?
A. Moitra, W. Perry, and A. S. Wein · 2015
Later among the works it cites.
Consistency thresholds for the planted bisection model
E. Mossel, J. Neeman, and A. Sly · 2015
Later among the works it cites.
Approval voting and incentives in crowdsourcing
N. Shah, D. Zhou, and Y. Peres · 2015
Later among the works it cites.
Double or nothing: Multiplicative incentive mechanisms for crowdsourcing
N. B. Shah and D. Zhou · 2015
Later among the works it cites.
Regularized minimax conditional entropy for crowdsourcing
D. Zhou, Q. Liu, J. C. Platt, C. Meek, and N. B. Shah · 2015
Later among the works it cites.
Information-theoretic thresholds for community detection in sparse networks
J. Banks and C. Moore · 2016
Closest in time.
Robust collaborative online learning
P. Christiano · 2016
Closest in time.
Strong truthfulness in multi-task peer prediction, 2016
V. Shnayder, R. Frongillo, A. Agarwal, and D. C. Parkes · 2016
Closest in time.