27
Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation [Robin Hanson, 2002] Roi Meron 07-Nov-12 Seminar in Information Markets, TAU 1

Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation [Robin Hanson, 2002] Roi Meron 07-Nov-12Seminar in Information Markets,

Embed Size (px)

Citation preview

Page 1: Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation [Robin Hanson, 2002] Roi Meron 07-Nov-12Seminar in Information Markets,

Seminar in Information Markets, TAU 1

Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation

[Robin Hanson, 2002]

Roi Meron

07-Nov-12

Page 2: Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation [Robin Hanson, 2002] Roi Meron 07-Nov-12Seminar in Information Markets,

Seminar in Information Markets, TAU 2

Outline• Scoring Rules• Market Scoring Rules• Logarithmic Market Scoring Rule(LMSR)• Distribution == Cost function• Combinatorial Markets

07-Nov-12

Page 3: Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation [Robin Hanson, 2002] Roi Meron 07-Nov-12Seminar in Information Markets,

Seminar in Information Markets, TAU 3

Event• finite set of outcomes (mutually exclusive and

exhaustive states of the world)– Example: all possible prime ministers in elections ’13

07-Nov-12

Page 4: Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation [Robin Hanson, 2002] Roi Meron 07-Nov-12Seminar in Information Markets,

Seminar in Information Markets, TAU 4

Scoring Rule• - Agent’s belief about the probability that state

will occur.• ) is the payment made to agent who reports

distribution if outcome is .

• A proper scoring rule is when

– Strictly proper: when is unique

07-Nov-12

Page 5: Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation [Robin Hanson, 2002] Roi Meron 07-Nov-12Seminar in Information Markets,

Seminar in Information Markets, TAU 5

Exercise• Is the following (binary)scoring rule proper?

where is the probability that will happen

(This is a variation of brier scoring rule)

07-Nov-12

Page 6: Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation [Robin Hanson, 2002] Roi Meron 07-Nov-12Seminar in Information Markets,

7

Logarithmic Scoring Rule

– to be big enough for agents to participate• The only strictly proper scoring rule in which the

score for outcome depends only on and not on the probabilities given to for

07-Nov-12 Seminar in Information Markets, TAU

Page 7: Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation [Robin Hanson, 2002] Roi Meron 07-Nov-12Seminar in Information Markets,

8

Logarithmic Scoring Rule

– to be big enough for agents to participate• The only strictly proper scoring rule in which the

score for outcome depends only on and not on the probabilities given to for – Example: Quadratic Scoring Rule

07-Nov-12 Seminar in Information Markets, TAU

Page 8: Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation [Robin Hanson, 2002] Roi Meron 07-Nov-12Seminar in Information Markets,

Seminar in Information Markets, TAU 10

Properness - simple case proof• Assume we have 2 possible outcomes.

• Derivative w.r.t. gives:

• Second derivative is negative.• Logarithmic scoring rule is proper.

07-Nov-12

Page 9: Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation [Robin Hanson, 2002] Roi Meron 07-Nov-12Seminar in Information Markets,

Seminar in Information Markets, TAU 11

Objective• We want multiple agents(traders) to share their

beliefs– Without paying each one– We want a single(unified) prediction.

• One option is a standard market(Double auction information markets)– What happens in thin markets?

07-Nov-12

Page 10: Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation [Robin Hanson, 2002] Roi Meron 07-Nov-12Seminar in Information Markets,

Seminar in Information Markets, TAU 12

Market Scoring Rule

• Market maker starts with an initial distribution . At each step, an agent reports his distribution.

• The report should be honest if we use LMSR. Why?

• The agent pays to the previous agent according to the scoring rule

• The market maker finally pays

07-Nov-12

Page 11: Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation [Robin Hanson, 2002] Roi Meron 07-Nov-12Seminar in Information Markets,

Seminar in Information Markets, TAU 13

Market Scoring Rule(2)

• Market maker subsidizes the reward for accurate predictions:– Gives incentive to participate and share your

knowledge– Increases liquidity– Easy to expand to multiple outcomes

07-Nov-12

Page 12: Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation [Robin Hanson, 2002] Roi Meron 07-Nov-12Seminar in Information Markets,

Seminar in Information Markets, TAU 14

Market Scoring Rule(3)• If only one agent participates, it is equivalent to

simple scoring rule.• If many agents participate, it gives the same

effect of a standard information market, at the cost of the payment to the last agent.

07-Nov-12

Page 13: Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation [Robin Hanson, 2002] Roi Meron 07-Nov-12Seminar in Information Markets,

Seminar in Information Markets, TAU 15

Logarithmic Market Scoring Rule (LMSR)

• Reminder: • is a parameter that controls:– liquidity– loss of the market maker– Adaptivity of the market maker.* Large values allow a trader to buy many shares at the current price without affecting the price drastically.

• Market maker’s worst case expected loss is the entropy of the initial distribution he gives,

07-Nov-12

Page 14: Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation [Robin Hanson, 2002] Roi Meron 07-Nov-12Seminar in Information Markets,

Seminar in Information Markets, TAU 16

• Typically, initial distribution is uniform, i.e. where is the number of possible outcomes.– Market maker’s loss is bounded by .

07-Nov-12

Page 15: Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation [Robin Hanson, 2002] Roi Meron 07-Nov-12Seminar in Information Markets,

Seminar in Information Markets, TAU 17

how do we implement a market?

07-Nov-12

Page 16: Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation [Robin Hanson, 2002] Roi Meron 07-Nov-12Seminar in Information Markets,

Seminar in Information Markets, TAU 18

Distribution is equal to Buying and Selling shares

• We can think of the market maker scoring rule as an automated market maker that:– Holds a list of how many units of the form “pays 1$ if the state is ” were sold (outstanding shares).– Has an instantaneous price ( for any outcome).– Will accept any fair bet.

• Its main task is to extract information implicit in the trades others make with it, in order to infer a new rational price.– The rational: people buying suggest that the price is too low and selling suggest that the price is too high.

07-Nov-12

Page 17: Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation [Robin Hanson, 2002] Roi Meron 07-Nov-12Seminar in Information Markets,

Seminar in Information Markets, TAU 19

LMSR price function• Let be the outcome which finally took place. – The market maker pays exactly . A Dollar to any share

holder.– On the other hand, it should be equal to the payment

using LSR.• We want a price function such that:

The price function is the current distribution “given” by the last agent.

07-Nov-12

Page 18: Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation [Robin Hanson, 2002] Roi Meron 07-Nov-12Seminar in Information Markets,

Seminar in Information Markets, TAU 20

LMSR price function(2)• The price function is the inverse of the scoring

rule function

• A large trade can be described by a series of “tiny” trades between to . The price of this trade event is given by integrating over in the range of .

• Probabilities represent prices for (very) small trades.

07-Nov-12

Page 19: Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation [Robin Hanson, 2002] Roi Meron 07-Nov-12Seminar in Information Markets,

Seminar in Information Markets, TAU 21

LMSR cost function

• For simplification, assume we have only 2 possible outcomes, then:

07-Nov-12

Page 20: Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation [Robin Hanson, 2002] Roi Meron 07-Nov-12Seminar in Information Markets,

Seminar in Information Markets, TAU 22

“How much?”• Buying shares means Selling . • Say someone wants to buy 20 shares of outcome .

He pays:

• In general, if a trader changes the outstanding volume from to , the payment is:

• If , i.e. selling, then the cost is negative, as expected.• People might find this version of LMSR more natural.

Buying and Selling instead of probabilities estimation.

07-Nov-12

Page 21: Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation [Robin Hanson, 2002] Roi Meron 07-Nov-12Seminar in Information Markets,

Seminar in Information Markets, TAU 23

Equivalence proofTrader’s profit if happens= a logarithmic scoring rule payment

07-Nov-12

Page 22: Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation [Robin Hanson, 2002] Roi Meron 07-Nov-12Seminar in Information Markets,

Seminar in Information Markets, TAU 24

Example

07-Nov-12

𝜋 ⅇ

Page 23: Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation [Robin Hanson, 2002] Roi Meron 07-Nov-12Seminar in Information Markets,

Seminar in Information Markets, TAU 25

• Will Wile E. Coyote fall off a cliff next year?

– Uniform priors:

07-Nov-12

Page 24: Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation [Robin Hanson, 2002] Roi Meron 07-Nov-12Seminar in Information Markets,

Seminar in Information Markets, TAU 27

Combinatorial Markets• Say we bet on the chances of rain of the following

week.– - will it rain on Sunday – - will it rain on Monday– - will it rain on Tuesday

• We can think of other events:– rain on Monday given it rains on Sunday…

• Ideally, trading on the probability of given should not result in a change in the probability of or a change in prob. “ given C”.

• But in fact…..07-Nov-12

Page 25: Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation [Robin Hanson, 2002] Roi Meron 07-Nov-12Seminar in Information Markets,

Seminar in Information Markets, TAU 28

LMSR local inference rule• Logarithmic rule bets on “A given B” preserve

and, for any event preserve and .• The other direction also holds.• In other words: All MSR except LMSR might

change . LMSR preserve it and probabilities regarding any other event .

07-Nov-12

Page 26: Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation [Robin Hanson, 2002] Roi Meron 07-Nov-12Seminar in Information Markets,

Seminar in Information Markets, TAU 29

Combinatorial Product Space• Given variables each with outcomes, a single

market scoring rule can make trades on any of the possible states, or any of the possible events.

• Creating a data structure to explicitly store the probability of every state is unfeasible for large values of .

• Computational complexity of updating prices and assets is NP-complete in worst-case.

07-Nov-12

Page 27: Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation [Robin Hanson, 2002] Roi Meron 07-Nov-12Seminar in Information Markets,

Seminar in Information Markets, TAU 30

THANK YOU

07-Nov-12