Market Scoring Rules conitzer@cs.duke.edu.

Slides:



Advertisements
Similar presentations
Hansons Market Scoring Rules Robin Hanson, Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation, Robin Hanson, Combinatorial.
Advertisements

Probability Predictions Ch. 1, Act. 5. Probability The study of random events. Random events are things that happen without predictability – e.g. the.
Mathematics in Today's World
Conditional Probability and Independence. Learning Targets 1. I can calculate conditional probability using a 2-way table. 2. I can determine whether.
DECISION MARKETS WITH GOOD INCENTIVES Yiling Chen (Harvard), Ian Kash (Harvard), Internet and Network Economics, 2011.
An Experimental Test of Information & Decision Markets Robin Hanson, Takashi Ishikida and John Ledyard Caltech 2/4/ minute presentation!
A Utility Framework for Bounded-Loss Market Makers
Collective Revelation: A Mechanism for Self-Verified, Weighted, and Truthful Predictions Sharad Goel, Daniel M. Reeves, David M. Pennock Presented by:
5.1 Basic Probability Ideas
Random Variables. A random variable X is a real valued function defined on the sample space, X : S  R. The set { s  S : X ( s )  [ a, b ] is an event}.
Introduction to Behavioral Statistics Probability, The Binomial Distribution and the Normal Curve.
CHAPTER Discrete Models  G eneral distributions  C lassical: Binomial, Poisson, etc Continuous Models  G eneral distributions 
Binomial Experiment A binomial experiment (also known as a Bernoulli trial) is a statistical experiment that has the following properties:
Section 3.2 Conditional Probability and the Multiplication Rule.
Conditional Probability Mass Function. Introduction P[A|B] is the probability of an event A, giving that we know that some other event B has occurred.
Chapter 3 Discrete Random Variables and Probability Distributions  Random Variables.2 - Probability Distributions for Discrete Random Variables.3.
Probability Distributions, Discrete Random Variables
Conditional Probability and the Multiplication Rule NOTES Coach Bridges.
CPS Proper scoring rules Vincent Conitzer
Chapter 14 Week 5, Monday. Introductory Example Consider a fair coin: Question: If I flip this coin, what is the probability of observing heads? Answer:
CHAPTER 10: Introducing Probability
Probability and Statistics for Computer Scientists Second Edition, By: Michael Baron Chapter 2: Probability CIS Computational Probability and.
CHAPTER 6 Random Variables
Probability 100% 50% 0% ½ Will happen Won’t happen
Chapter 3: Probability Topics
Probability Predictions Ch. 1, Act. 5.
Random variables (r.v.) Random variable
Proper Scoring Rules
Dihybrid Cross.
Chapters 4 Probability Distributions
Binomials GrowingKnowing.com © 2011 GrowingKnowing.com © 2011.
Campo Elementary School
Week 6 Probability and Assessment
Chapter Randomness, Probability, and Simulation
Chapter 5 Sampling Distributions
Daniela Stan Raicu School of CTI, DePaul University
Means and Variances of Random Variables
Chapter 3 Discrete Random Variables and Probability Distributions
Lecture 11 Sections 5.1 – 5.2 Objectives: Probability
Probability Probability underlies statistical inference - the drawing of conclusions from a sample of data. If samples are drawn at random, their characteristics.
Suppose you have $100 in a savings account earning 2 percent interest a year. After five years, how much would you have? You’ll have more than $102 at.
Discrete random variable X Examples: shoe size, dosage (mg), # cells,…
Probability.
Probability.
Mr Barton’s Maths Notes
Tests for Convergence, Pt. 2
Now it’s time to look at…
Tests for Convergence, Pt. 2
Tests for Convergence, Pt. 2
Section 1.1: Equally Likely Outcomes
Robust Mechanism Design with Correlated Distributions
Probability, Part I.
Random Variables Binomial Distributions
Probability True or False? Answers.
Chapter 5 Sampling Distributions
Vincent Conitzer CPS 173 Mechanism design Vincent Conitzer
Preference elicitation/ iterative mechanisms
A few more practice questions for the midterm
Probability of a single event
Vincent Conitzer Utility theory Vincent Conitzer
Peer Prediction
Randomness, Probability, and Simulation
12/12/ A Binomial Random Variables.
Review of the Binomial Distribution
Independence and Counting
Mathematical Foundations of BME Reza Shadmehr
Independence and Counting
Independence and Counting
Chapter 8: Binomial and Geometric Distributions
Daniela Stan Raicu School of CTI, DePaul University
Presentation transcript:

Market Scoring Rules conitzer@cs.duke.edu

Multiple forecasters What if we have more than one forecaster? One idea: use a proper scoring rule for everyone separately, then aggregate Median? Mean? Geometric mean?

A story A coin may be biased (P(H|B) = .75) or unbiased (P(H|not B)=.5) Prior: half of coins are biased (P(B)=.5) We ask a forecaster to predict the outcome of the next toss of this coin Suppose he has seen this coin be tossed once before, and the outcome was H What should the forecaster predict (if rewarded with a proper scoring rule?)

Story, continued Same as before, but now there are two forecasters Each of them has observed a separate toss of the coin before, and in both cases the answer was H What should they each predict? … assuming they are each rewarded via a proper scoring rule and do not know about each other? What should someone who has observed both coin tosses predict? … but what if the two forecasters observed the same toss?

Takeaway We would like forecasters’ information to aggregate No way to do this automatically from individual forecasts unless we know more about the information structure But what if we want our system to work in a way that is independent of the information structure? (Possible) solution: assume the agents know the information structure

Market scoring rule Let the agents report probabilities pi in sequence, i = 1, …, n Pay agent i: S(pi, ω) - S(pi-1, ω) Set p0 to something arbitrary Total payment: S(pn, ω) - S(p0, ω) Bounded (if S is bounded)

How it’s supposed to work (with logarithmic scoring rule) Information has been aggregated! Red must have seen Heads. I also saw Heads. I have no useful information to contribute. I saw Heads. .65 .67 .67 Initialized at .625 (maybe; could also just be initialized at .5) Payment if Heads happens eventually ln(.65) - ln(.625) ln(.67) - ln(.65) ln(.67) - ln(.67) = 0 Payment if Tails happens eventually ln(.35) - ln(.375) ln(.33) - ln(.35) ln(.33) - ln(.33) = 0

A failure mode: predict XOR of your fair coins Information has not been aggregated I have no idea what Red saw. I saw Heads… I saw Heads. That doesn’t tell me anything! .5 .5 Initialized at .5

Brittleness of previous example: suppose coins come up Heads with .51 Information has been aggregated! Red must have seen Heads. I saw Heads. I saw Heads. .49 Initialized at .5 Blue takes most of the spoils. Is this fair? Incentive to wait? Who will cave first? ln(.51) - ln(.5) ln(1) - ln(.51) = reported probability that the coins came up the same

Another failure mode: sneaky Red on XOR I saw Tails, but I’m going to make it look like I saw Heads. Red must have seen Heads. I saw Heads. .49 Gotcha! 1 Initialized at .5 ln(.49) - ln(.5) ln(0) - ln(.49) ln(1) - ln(0) What if Blue is also strategic?

Principal-aligned proper scoring rules, revisited [Shi, Conitzer, Guo 2009] Market scoring rules are not principal-aligned (why?) Nice thing about market scoring rules: upper bound on subsidy independent of n = #agents providing information I.e., cost of obtaining all information is O(1) Upper bound with principal alignment: O(n) (why?) Matching lower bound in the paper (assuming nonzero incentive for prediction)

Relationship between market scoring rules and more traditional forms of prediction markets [Hanson 2003, 2007; Chen and Pennock 2007] Consider a security that pays out $1 if outcome ω occurs Let qω denote the number of such securities outstanding Consider a market maker always willing to sell more such securities at price pω(q) (or buy at - pω(q)) Want Σω pω(q) = 1 for all q Suppose pω(q) is increasing in qω (to 1 in the limit) Suppose the total paid price is path independent, C(q) Moving to q’ from q costs C(q’) - C(q) I want to buy (2, 1, 0) I want to buy (2, 1, 0) too That’ll cost you $1 Now it costs $1.50

Market maker for logarithmic scoring rule Let C(q) = ln Σω exp{qω} Then the current price of an ω security is pω(q) = exp{qω} / Σω’ exp{qω’} Suppose you believe the probability vector should be p’ Suppose you end up trading the market towards a q’ such that Σω’ exp{q’ω’} = k You will want to have exp{q’ω} / k = p’ω or q’ω = ln kp’ω (why?) So you will pay ln Σω’ exp{q’ω’} = ln k (minus a constant) For the realized outcome ω you will receive q’ω = ln kp’ω (minus a constant) So you get ln kp’ω - ln k = ln p’ω (plus/minus a constant)!