The recent advent of human computation – employing nonexperts to solve problems – has inspired theoretical work in mechanism design for eliciting information when responses cannot be verified.We study a popular practical method, output agreement, from a theoretical perspective. In output agreement, two agents are given the same inputs and asked to produce some output; they are scored based on how closely their responses agree. Although simple, output agreement raises new conceptual questions. Primary is the fundamental importance of common knowledge: We show that, rather than being truthful, output agreement mechanisms elicit common knowledge from participants.We show that common knowledge is essentially the best that can be hoped for in an...
In crowdsourcing when there is a lack of verification for contributed answers, output agreement mech...
McKelvey and Page [1986] investigate the effect that common knowledge of an aggregate statistic of i...
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors...
The recent advent of human computation – employing non-experts to solve problems – has inspired theo...
The recent advent of human computation — employing groups of non-experts to solve problems — has mot...
We consider two simple variants of a framework for reasoning about knowledge amongst communicating g...
We study a setting where Bayesian agents with a common prior have private information related to an ...
This paper surveys the notion of common knowledge taken from game theory and computer science. It s...
In this paper, we propose a new mechanism - the Disagreement Mechanism - which elicits privately-hel...
The problem of peer prediction is to elicit information from agents in settings without any objectiv...
This paper surveys the implications of “common knowledge” in interactive epistemology and game theor...
It is well known that when players have private information, vis a vis the designer, and their prefe...
This dissertation collects four papers on common knowledge and one on introspection principles in ep...
We study a model of pairwise communication in a finite population of Bayesian agents. We show that, ...
Suppose that two individuals, person X and person Y, communicate with each other in such a way that ...
In crowdsourcing when there is a lack of verification for contributed answers, output agreement mech...
McKelvey and Page [1986] investigate the effect that common knowledge of an aggregate statistic of i...
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors...
The recent advent of human computation – employing non-experts to solve problems – has inspired theo...
The recent advent of human computation — employing groups of non-experts to solve problems — has mot...
We consider two simple variants of a framework for reasoning about knowledge amongst communicating g...
We study a setting where Bayesian agents with a common prior have private information related to an ...
This paper surveys the notion of common knowledge taken from game theory and computer science. It s...
In this paper, we propose a new mechanism - the Disagreement Mechanism - which elicits privately-hel...
The problem of peer prediction is to elicit information from agents in settings without any objectiv...
This paper surveys the implications of “common knowledge” in interactive epistemology and game theor...
It is well known that when players have private information, vis a vis the designer, and their prefe...
This dissertation collects four papers on common knowledge and one on introspection principles in ep...
We study a model of pairwise communication in a finite population of Bayesian agents. We show that, ...
Suppose that two individuals, person X and person Y, communicate with each other in such a way that ...
In crowdsourcing when there is a lack of verification for contributed answers, output agreement mech...
McKelvey and Page [1986] investigate the effect that common knowledge of an aggregate statistic of i...
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors...