#### DMCA

## Max Algorithms in Crowdsourcing Environments

Citations: | 13 - 1 self |

### Citations

522 | Designing games with a purpose - Ahn, Dabbish - 2008 |

71 |
Computing with noisy information
- Feige, Peleg, et al.
- 1994
(Show Context)
Citation Context ...d explore different types of max algorithms, under different evaluation criteria. There is a substantial body of work in the theory community that explores algorithms with “faulty” comparisons (e.g., =-=[2, 3, 4, 7, 8, 9, 16, 21]-=-), and that work is clearly applicable here. However, those works use relatively simple models that often do not capture all of the crowdsourcing issues (such as the monetary cost required to execute ... |

47 | Epistemic Democracy: Generalizing the Condorcet Jury Theorem
- List, Gooden
- 2001
(Show Context)
Citation Context ...gorithms). The proof can be found in our complete report [19]. As mentioned in Section 3.1, AggrQuality() is assumed to be non-decreasing in the political philosophy literature for the plurality rule =-=[14]-=-, and thus, we are confident that ConstantSequences returns the optimal r and s values. 992WWW 2012 – Session: Crowdsourcing April 16–20, 2012, Lyon, France 4.2 RandomHillclimb RandomHillclimbbuildso... |

37 |
Computing with Unreliable Information
- Feige, Peleg, et al.
- 1990
(Show Context)
Citation Context ...d explore different types of max algorithms, under different evaluation criteria. There is a substantial body of work in the theory community that explores algorithms with “faulty” comparisons (e.g., =-=[2, 3, 4, 7, 8, 9, 16, 21]-=-), and that work is clearly applicable here. However, those works use relatively simple models that often do not capture all of the crowdsourcing issues (such as the monetary cost required to execute ... |

32 |
Fault-tolerant sorting networks
- Assaf, Upfal
- 1991
(Show Context)
Citation Context ...d explore different types of max algorithms, under different evaluation criteria. There is a substantial body of work in the theory community that explores algorithms with “faulty” comparisons (e.g., =-=[2, 3, 4, 7, 8, 9, 16, 21]-=-), and that work is clearly applicable here. However, those works use relatively simple models that often do not capture all of the crowdsourcing issues (such as the monetary cost required to execute ... |

21 | Sorting and searching in the presence of memory faults (without redundancy
- Finocchi, Italiano
(Show Context)
Citation Context ... problem are provided. An overview paper on resilient algorithms is [13], which presents work done in resilient counting, resilient sorting, and the resilient max algorithm problem. Along these lines =-=[10, 11]-=- attempt to understand for a given algorithm, how many corruptions can be tolerated for it to run correctly. In our work we assume that no item from the input may be corrupted, but that humans (who ar... |

20 |
On fault-tolerant networks for sorting
- Yao, Yao
- 1985
(Show Context)
Citation Context |

17 | Optimal resilient sorting and searching in the presence of memory faults
- FINOCCHI, GRANDONI, et al.
- 2009
(Show Context)
Citation Context ... problem are provided. An overview paper on resilient algorithms is [13], which presents work done in resilient counting, resilient sorting, and the resilient max algorithm problem. Along these lines =-=[10, 11]-=- attempt to understand for a given algorithm, how many corruptions can be tolerated for it to run correctly. In our work we assume that no item from the input may be corrupted, but that humans (who ar... |

16 |
On selecting the largest element in spite of erroneous information
- Ravikumar, Ganesan, et al.
- 1987
(Show Context)
Citation Context |

11 |
Parallel sorting
- Bollobas, Thomason
- 1983
(Show Context)
Citation Context ...has also been done in sorting in a particular number of rounds (or steps as we defined them). Häggvist and Hell prove bounds on the complexity of sorting n items in r rounds [12]. In the same spirit, =-=[5]-=- answers the following question: How many processing units are required if one wants to sort n items in r rounds? In these two works there is no uncertainty about the data nor the comparisons. Voting ... |

11 | Designing reliable algorithms in unreliable memories
- FINOCCHI, GRANDONI, et al.
- 2005
(Show Context)
Citation Context |

9 | Sorting and selection with imprecise comparisons
- Ajtai, Feldman, et al.
- 2009
(Show Context)
Citation Context |

9 |
Sorting and merging in rounds
- Haggkvist, Hell
- 1982
(Show Context)
Citation Context ...er. Sorting in steps Work has also been done in sorting in a particular number of rounds (or steps as we defined them). Häggvist and Hell prove bounds on the complexity of sorting n items in r rounds =-=[12]-=-. In the same spirit, [5] answers the following question: How many processing units are required if one wants to sort n items in r rounds? In these two works there is no uncertainty about the data nor... |

6 | 2010) “An Optimal SingleWinner Preferential Voting System Based on Game Theory” http://people.csail.mit.edu/rivest/gt/latest conf.pdf
- Rivest, Shen
(Show Context)
Citation Context ...parisons. Voting systems Voting systems have been used to declare a winner (maximum item in our case) according to votes (comparisons to other items in our case). One work in this line of research is =-=[17]-=-, which declares a winner such that it creates the least disagreement with the votes of the crowd. Furthermore, deCondorcet[6] andListandGoodin[14]provide useful insights for the plurality rule from t... |

4 |
Finding the maximum and the minimum
- Aigner
- 1997
(Show Context)
Citation Context |

3 | How to assure the quality of human computation tasks when majority voting fails
- Sun, Dance, et al.
- 2011
(Show Context)
Citation Context ..., we can use our framework to tune the tournament algorithm in the setting described in [15]. Tournament algorithms have been used in crowdsourcing to determine the correct answer to a difficult task =-=[18]-=-. Answersprovidedbynworkerstoatask(notnecessarilyacomparison) are compared (in pairs) by workers. The winners of the pairwise comparisons are compared with each other in the next step. This process co... |

1 |
Condorcet. Essai Sur L’ Application De L’ Analyse À
- de
(Show Context)
Citation Context ...omplete report [19]). In the following, Comp(S,r) will be considered equivalent to Comp(S,r,RP). In all known cases, AggrQuality() is non-decreasing on r (although there is no formal proof since 1785 =-=[6]-=-, when the problem was first stated). 3.2 BubbleMaxAlgorithms The family of Bubble max algorithms (denoted by AB) is named after the bubble-sort algorithm, because of its similarities to it. Algorithm... |

1 |
Resilient Algorithms and Data Structures
- Italiano
- 2010
(Show Context)
Citation Context ...rupted items in the input. One of the first papers in this area is [9], where resilient algorithms for sorting and the max algorithm problem are provided. An overview paper on resilient algorithms is =-=[13]-=-, which presents work done in resilient counting, resilient sorting, and the resilient max algorithm problem. Along these lines [10, 11] attempt to understand for a given algorithm, how many corruptio... |