• Aucun résultat trouvé

A Minimax Optimal Algorithm for Crowdsourcing

N/A
N/A
Protected

Academic year: 2021

Partager "A Minimax Optimal Algorithm for Crowdsourcing"

Copied!
10
0
0

Texte intégral

Loading

Figure

Table 1: Synthetic data: estimation error E (|| θ ˆ − θ|| ∞ ).

Références

Documents relatifs

This suggests a belief that voters are able to judge candidates in an ordinal scale of merit with two grades, so AV becomes MJ with a language of two grades (called Approval Judgment

Index Terms— optimal control, singular control, second or- der optimality condition, weak optimality, shooting algorithm, Gauss-Newton

The ellipsoid’s proportions, and the Hamming weights, reflect the ratio of voting weight to influence, measured as Penrose-Banzhaf voting power.. In particular, the

The approach consists in two parts, the first being an offline optimization that first solves a family of short term problems associated to a discretized set of battery ages and

It is important to point out that both the fixed communication cost and the consumption rate depend on whether the particular sensor spends the period awake or asleep: sleeping

Among its widespread applications, variants of the majority process have been used in the area of distributed community detection [4], where the voting time is essentially

In this context, the objectives of the present study were three-fold: (1) studying experimentally the statistical distribution of (extreme) wave heights considering variable

In this paper we have provided optimal algo- rithms for the adjoint checkpointing problem with two storage locations: a bounded number of memory slots with zero access cost and