Collective Revelation: A Mechanism for Self-Verified, Weighted, and Truthful Predictions Sharad Goel, Daniel M. Reeves, David M. Pennock Presented by:

Slides:



Advertisements
Similar presentations
Agenda of Week V. Forecasting
Advertisements

Eliciting Honest Feedback 1.Eliciting Honest Feedback: The Peer-Prediction Model (Miller, Resnick, Zeckhauser) 2.Minimum Payments that Reward Honest Feedback.
Presented By: Ofir Chen Based on: Designing Markets for Prediction by Yilling Chen and David M. Pennock 2010.
Algorithmic Game Theory Uri Feige Robi Krauthgamer Moni Naor Lecture 10: Mechanism Design Lecturer: Moni Naor.
Incentivize Crowd Labeling under Budget Constraint
Non myopic strategy Truth or Lie?. Scoring Rules One important feature of market scoring rules is that they are myopic strategy proof. That means that.
Mean, Proportion, CLT Bootstrap
3. Basic Topics in Game Theory. Strategic Behavior in Business and Econ Outline 3.1 What is a Game ? The elements of a Game The Rules of the.
The Voting Problem: A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor SIUC.
Game Theory in Wireless and Communication Networks: Theory, Models, and Applications Lecture 6 Auction Theory Zhu Han, Dusit Niyato, Walid Saad, Tamer.
Game Theory 1. Game Theory and Mechanism Design Game theory to analyze strategic behavior: Given a strategic environment (a “game”), and an assumption.
1 Prediction Markets (PM) Lloyd Nirenberg, Ph.D. Shannon Bayes Venture Corp. Enterprise Resource Management Symposium 25 APR 06.
This paper reports an experimental study based on the popular Chinos game, in which three players, arranged in sequence, have to guess the total number.
Game Theory, Mechanism Design, Differential Privacy (and you). Aaron Roth DIMACS Workshop on Differential Privacy October 24.
DECISION MARKETS WITH GOOD INCENTIVES Yiling Chen (Harvard), Ian Kash (Harvard), Internet and Network Economics, 2011.
© newsfutures 1 Prediction Markets: Collective Work Prediction Markets Collective Work Emile Servan-Schreiber, PhD NewsFutures.
Probability & Counting Rules Chapter 4 Created by Laura Ralston Revised by Brent Griffin.
Game Theory The study of rational behavior among interdependent agents Agents have a common interest to make the pie as large as possible, but Agents have.
A New Understanding of Prediction Markets via No-Regret Learning.
Prediction Markets & Information Aggregation Yiling Chen, Harvard SEAS.
BABS 502 Judgment in Forecasting and Forecast Accuracy Lecture 2 February 28, 2008.
Robust Mechanisms for Information Elicitation Aviv Zohar & Jeffrey S. Rosenschein.
Agent Technology for e-Commerce Chapter 10: Mechanism Design Maria Fasli
CS522: Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian
Probability Forecasting, Probability Evaluation, and Scoring Rules: Expanding the Toolbox Robert L. Winkler Duke University Subjective Bayes Workshop –
Extensions to Consumer theory Inter-temporal choice Uncertainty Revealed preferences.
Rapid Analysis Farrokh Alemi, Ph.D.. Analysis takes time and reflection People must be lined up and their views sought. People must be lined up and their.
© 2002 McGraw-Hill Companies, Inc., McGraw-Hill/Irwin TURNING MARKETING INFORMATION INTO ACTION.
An Experimental Test of Information & Decision Markets Robin Hanson, Takashi Ishikida and John Ledyard Caltech 2/4/ minute presentation!
Judgment in Forecasting, Forecast Accuracy, Moving Averages and Decomposition Lecture 2 February 23, 2010.
1 Computation in a Distributed Information Market Joan Feigenbaum (Yale) Lance Fortnow (NEC Labs) David Pennock (Overture) Rahul Sami (Yale)
The Strategic Role of Information in Sales Management
Gaming Prediction Markets: Equilibrium Strategies with a Market Maker Yilin Chen, Daniel M. Reeves, David M. Pennock, Robin D. Hanson, Lance Fortnow, Rica.
Chapter 3 Forecasting McGraw-Hill/Irwin
McGraw-Hill/Irwin Copyright 2006 by The McGraw-Hill Companies, Inc.
Forecasting By Steve Quiat CPIM, CSCP Hunter Douglas, Inc.
MARKET VALUE HOME MARKET VALUE HOME Who Determines the Determines the of your.
Mechanisms for Making Crowds Truthful Andrew Mao, Sergiy Nesterko.
The Multiplicative Weights Update Method Based on Arora, Hazan & Kale (2005) Mashor Housh Oded Cats Advanced simulation methods Prof. Rubinstein.
Derivative Action Learning in Games Review of: J. Shamma and G. Arslan, “Dynamic Fictitious Play, Dynamic Gradient Play, and Distributed Convergence to.
Economics of Information
Prediction Markets and Business Forecasts Opportunities and Challenges in the New Information Era Professor: Andrew B. Whinston McCombs School of Business.
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 21.
Mechanism Design CS 886 Electronic Market Design University of Waterloo.
Auction Theory תכנון מכרזים ומכירות פומביות Topic 7 – VCG mechanisms 1.
A Truth Serum for Sharing Rewards Arthur Carvalho Kate Larson.
Estimating a Population Proportion
Operations Management For Competitive Advantage 1Forecasting Operations Management For Competitive Advantage Chapter 11.
Air Travel Forecast Problem 1 Objectives Introduction to forecasting methods Experience with Delphi Experience with consensus-seeking techniques Strength/weaknesses.
Regret Minimizing Equilibria of Games with Strict Type Uncertainty Stony Brook Conference on Game Theory Nathanaël Hyafil and Craig Boutilier Department.
New Product Development with Internet-based Information Markets: Theory and Empirical Application Arina Soukhoroukova, Martin Spann Johann Wolfgang Goethe-University,
An Introduction to Prediction Markets (a.k.a. Idea Futures, Decision Markets, Information Markets, and Event Markets) Presented by: Muhammad Daniyal Shafiq.
Lecture 3 on Individual Optimization Uncertainty Up until now we have been treating bidders as expected wealth maximizers, and in that way treating their.
Week 1 WHY DO SOCIAL RESEARCH ?
Performance of prediction markets with Kelly bettors David Pennock (Yahoo!) with John Langford (Yahoo!) & Alina Beygelzimer (IBM)
1 Computation in a Distributed Information Market Joan Feigenbaum (Yale) Lance Fortnow (NEC Labs) David Pennock (Overture) Rahul Sami (Yale) To appear.
Chapter 1: Introduction
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 22.
An Introduction to Prediction Markets (a.k.a. Idea Futures, Decision Markets, Information Markets, and Event Markets) alex kirtland / UsableMarkets 25.
Find Expected Value.  A collection of outcomes is partitioned into n events, no two of which have any outcomes in common. The probabilities of n events.
Scoring Rules, Generalized Entropy and Utility Maximization Victor Richmond R. Jose Robert F. Nau Robert L. Winkler The Fuqua School of Business Duke University.
CPS Proper scoring rules Vincent Conitzer
ENRICHING STUDENTS MATHEMATICAL INTUITIONS WITH PROBABILITY GAMES AND TREE DIAGRAMS NCTM PRESENTATION BY: ADOLFO CANON Rice University Summer.
The normal approximation for probability histograms.
Measurement and Scaling Concepts
Chapter 9 Forecasting Copyright 2015 Health Administration Press.
Market Scoring Rules
Game Theory in Wireless and Communication Networks: Theory, Models, and Applications Lecture 6 Auction Theory Zhu Han, Dusit Niyato, Walid Saad, Tamer.
Prediction Markets Collective Work
Preference elicitation/ iterative mechanisms
Presentation transcript:

Collective Revelation: A Mechanism for Self-Verified, Weighted, and Truthful Predictions Sharad Goel, Daniel M. Reeves, David M. Pennock Presented by: Nir Shabbat

Outline Introduction – Background and Related Work The Settings A Mechanism For Collective Revelation – The Basic Mechanism – A General Technique for Balancing Budgets Summary

Introduction In many cases, a decision maker may seek to elicit and aggregate the opinions of multiple experts. Ideally, would like a mechanism that is: 1.Incentive Compatible - Rewards participants to be truthful 2.Information Weighted - Adjusts for the fact that some experts are better informed than others 3.Self-Verifying - Works without the need for objective, “ground truth” observations 4.Budget Balanced - Makes no net transfers to agent

Background and Related Work Proper Scoring Rules – Rewards the agent by assessing his forecast against an actual observed outcome. Agents are incentivized to be truthful. For example, using the Brier scoring rule: We get:

Background and Related Work Peer Prediction Methods – Can be Incentive Compatible and Self-Verifying. For example, the Bayesian truth serum asks agents to report both their own prediction and their prediction of other agents’ predictions. Relies on the general property of information- scores, that a truthful answer constitutes the best guess about the most “surprisingly common” answer.

Background and Related Work

Predictions Markets – encourage truthful behavior and automatically aggregate predictions from agents with diverse information. For example, a prediction market for U.S. presidential elections. Agents buy and sell assets tied to an eventual Democratic or Republican win. Each share pay $1 if the corresponding event occurs.

Background and Related Work Delphi Method – generates consensus predictions from experts generally through a process of structured discussion. In each round, each expert anonymously provides his forecast and reasons, at the end of the round, market maker summarize the forecasts and reasons. Process is repeated until forecasts converge.

Background and Related Work Competitive Forecasting – elicits confidence intervals on predictions, thereby facilitating information weighting. Like prediction markets, competitive forecasting rewards accuracy, though is not rigorously incentive compatible and relies on benchmarking against objective measurements.

Background and Related Work Incentive Compatible Information Weighted Self- Verifying Proper Scoring Rules ● Prediction Markets ○● Peer Prediction ○● Delphi Method ● Competitive Forecasting ○● Polls ● Collective Revelation ○●●

The Settings

A Mechanism For Collective Revelation

The Basic Mechanism

Simply put, scoring against a single Bernoulli observation can only reveal the agent’s expectation and not the uncertainty of it’s prediction (as quantified by the variance). So in order for a mechanism to be Information-Weighted (for Bernoulli outcome) it must score agents against multiple observations.

The Basic Mechanism

THEOREM 1 (Cont’d) Then: (*) is a strict Nash Equilibrium.

The Basic Mechanism

CORROLARY Suppose all agents play the equilibrium strategy. Define:

The Basic Mechanism

A General Technique for Balancing Budgets

PROOF (Cont’d) Summing over all players we get:

A General Technique for Balancing Budgets

Summary We’ve seen a mechanism, i.e. Collective Revelation, for aggregating experts opinions which is: – Incentive Compatible – Information Weighed – Self-Verifying We’ve seen a general technique for constructing budget balanced mechanisms that applies both to collective revelation and to past peer- predictions method.

THE END