Results 1 
4 of
4
Max Algorithms in Crowdsourcing Environments
"... Our work investigates the problem of retrieving the maximum item from a set in crowdsourcing environments. We first develop parameterized families of max algorithms, that take as input a set of items and output an item from the set that is believed to be the maximum. Such max algorithms could, for i ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
(Show Context)
Our work investigates the problem of retrieving the maximum item from a set in crowdsourcing environments. We first develop parameterized families of max algorithms, that take as input a set of items and output an item from the set that is believed to be the maximum. Such max algorithms could, for instance, select the best Facebook profile that matches a given person or the best photo that describes a given restaurant. Then, we propose strategies that select appropriatemaxalgorithmparameters. Ourframeworksupports various human error and cost models and we consider many of them for our experiments. We evaluate under many metrics, both analytically and via simulations, the tradeoff between three quantities: (1) quality, (2) monetary cost, and (3) execution time. Also, we provide insights on the effectiveness of the strategies in selecting appropriate max algorithm parameters and guidelines for choosing max algorithms and strategies for each application.
The Importance of Being Expert: Efficient MaxFinding in Crowdsourcing For reviewing purposes only. Please do not distribute!
"... Οὐ piάνυ ἡμῖν οὕτω φροντιστέον τί ἐροῦσιν οἱ piολλοὶ ἡμᾶς, ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Οὐ piάνυ ἡμῖν οὕτω φροντιστέον τί ἐροῦσιν οἱ piολλοὶ ἡμᾶς,
Minimum and maximum against k lies∗
"... Abstract: A neat 1972 result of Pohl asserts that d3n/2e−2 comparisons are sufficient, and also necessary in the worst case, for finding both the minimum and the maximum of an nelement totally ordered set. The set is accessed via an oracle for pairwise comparisons. More recently, the problem has be ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract: A neat 1972 result of Pohl asserts that d3n/2e−2 comparisons are sufficient, and also necessary in the worst case, for finding both the minimum and the maximum of an nelement totally ordered set. The set is accessed via an oracle for pairwise comparisons. More recently, the problem has been studied in the context of the Rényi–Ulam liar games, where the oracle may give up to k false answers. For large k, an upper bound due to Aigner shows that (k+O( k))n comparisons suffice. We improve on this by providing an algorithm with at most (k + 1+C)n+O(k3) comparisons for some constant C. A recent result of Pálvölgyi provides a lower bound of the form (k+1+0.5)n−Dk, so our upper bound for the coefficient of n is tight up to the value of C. Key words and phrases: computing the minimum and maximum, computation against lies, number of comparisons, liar games, computation in the presence of errors 1