Combinatorial Pair Testing: Distinguishing Workers from Slackers

Autor:	Eppstein, David, Goodrich, Michael T., Hirschberg, Daniel S.
Rok vydání:	2013
Předmět:	Computer Science - Data Structures and Algorithms F.2.2
Druh dokumentu:	Working Paper
Popis:	We formalize a problem we call combinatorial pair testing (CPT), which has applications to the identification of uncooperative or unproductive participants in pair programming, massively distributed computing, and crowdsourcing environments. We give efficient adaptive and nonadaptive CPT algorithms and we show that our methods use an optimal number of testing rounds to within constant factors. We also provide an empirical evaluation of some of our methods. Comment: 12 pages. Extended version of a paper to appear at the Algorithms and Data Structures Symposium (WADS 2013)
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1305.0110 Zobrazit plný text záznamu View this record from Arxiv