Deep Bayesian Trust : A Dominant and Fair Incentive Mechanism for Crowd

April 16, 2018 Β· Declared Dead Β· πŸ› AAAI Conference on Artificial Intelligence

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Naman Goel, Boi Faltings arXiv ID 1804.05560 Category cs.GT: Game Theory Cross-listed cs.AI, cs.HC Citations 31 Venue AAAI Conference on Artificial Intelligence Last Checked 6 months ago
Abstract
An important class of game-theoretic incentive mechanisms for eliciting effort from a crowd are the peer based mechanisms, in which workers are paid by matching their answers with one another. The other classic mechanism is to have the workers solve some gold standard tasks and pay them according to their accuracy on gold tasks. This mechanism ensures stronger incentive compatibility than the peer based mechanisms but assigning gold tasks to all workers becomes inefficient at large scale. We propose a novel mechanism that assigns gold tasks to only a few workers and exploits transitivity to derive accuracy of the rest of the workers from their peers' accuracy. We show that the resulting mechanism ensures a dominant notion of incentive compatibility and fairness.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Game Theory

R.I.P. πŸ‘» Ghosted

Blockchain Mining Games

Aggelos Kiayias, Elias Koutsoupias, ... (+2 more)

cs.GT πŸ› EC πŸ“š 273 cites 10 years ago

Died the same way β€” πŸ‘» Ghosted