fundamental limitations of networked decision systems

25
Fundamental Limitations of Networked Decision Systems Munther A. Dahleh Laboratory for Information and Decision Systems MIT AFOSR-MURI Kick-off meeting, Sept, 2009

Upload: hailey

Post on 02-Feb-2016

26 views

Category:

Documents


0 download

DESCRIPTION

Fundamental Limitations of Networked Decision Systems. Munther A. Dahleh Laboratory for Information and Decision Systems MIT AFOSR-MURI Kick-off meeting, Sept, 2009. TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A A. Smart Grid. - PowerPoint PPT Presentation

TRANSCRIPT

Page 1: Fundamental Limitations of Networked Decision Systems

Fundamental Limitations of Networked Decision Systems

Munther A. Dahleh

Laboratory for Information and Decision Systems

MIT

AFOSR-MURI Kick-off meeting, Sept, 2009

Page 2: Fundamental Limitations of Networked Decision Systems

2

Smart Grid

Page 3: Fundamental Limitations of Networked Decision Systems

3

Drug Prescription: Marketing

The drugs your physician prescribes may well depend on the behavior of an opinion leader in his or her social network in addition to your doctor’s own knowledge of or familiarity with those products.

Page 4: Fundamental Limitations of Networked Decision Systems

4

Smoking

Whether a person quits smoking is largely shaped by social pressures, and people tend to quit smoking in groups. If a spouse quits smoking, the other spouse is 67% less likely to smoke. If a friend quits, a person is 36% less likely to still light up. Siblings who quit made it 25% less likely that their brothers and sisters would still smoke.

Page 5: Fundamental Limitations of Networked Decision Systems

5

Social Networks and Politics

Network structure ofpolitical blogs prior to 2004

presidential elections

Page 6: Fundamental Limitations of Networked Decision Systems

6

Networks: Connectivity/capacity

Engineered Human/Selfish

Computation Learning Decisions

Nature of Interaction: Cyclic/Sequential

Outline

Page 7: Fundamental Limitations of Networked Decision Systems

Learning Over Complex Networks

In Collaboration:

Daron Acemoglu

Ilan Lobel

Asuman Ozdaglar

Page 8: Fundamental Limitations of Networked Decision Systems

8

The Tipping Point: M. Gladwell

The Tipping Point is that magic moment when an idea, trend, or social behavior crosses a threshold, tips, and spreads like wildfire. Just as a single sick person can start an epidemic of the flu, so too can a small but precisely targeted push cause fashion trend, the popularity of a new product, or a drop of crime rate.

Page 9: Fundamental Limitations of Networked Decision Systems

9

Objective

Develop Models that can capture the impact of a social network on learning and decision making

Page 10: Fundamental Limitations of Networked Decision Systems

10

Who's Buying the Newest Phone and Why?

This phone has great

functionality.

1Got it!

I read positive reviews, and Lisa got it.

2Got it!

3Got it!

4Got it!

Everyone has it, but 3G speeds are

rather lacking.

5Didn’t.

It looks good, but Jane didn’t get it despite all her

friends having it.

6Didn’t.

7

Before I asked around, I thought the phone was perfect. But now I’m getting

mixed opinions.

Should I get it?

Page 11: Fundamental Limitations of Networked Decision Systems

11

Formulation: Two States

This phone has great

functionality.

1Got it!

I read positive reviews, and Lisa got it.

2Got it!

3Got it!

4Got it!

Everyone has it, but 3G speeds are

rather lacking.

5Didn’t.

It looks good, but Jane didn’t get it despite all her

friends having it.

6Didn’t.

7

Before I asked around, I thought the phone was perfect. But now I’m getting

mixed opinions.

Should I get it?

Page 12: Fundamental Limitations of Networked Decision Systems

12

General Setup

Two possible states of the world both equally likely. A sequence of agents making binary decisions Agent n obtains utility 1 if and utility 0 otherwise.

Each agent has an iid private signal . The signal is sampled from a cumulative density .

The neighborhood:

The neighborhoods is generated according to arbitrary independent distributions .

Information:

µ2 f0;1g

(n = 1;2;:::) xn .xn =µ

sn 2 [0;1]Fµ

I n = fsn ; ­ n;xk for all k 2 ­ ng

­ n ½f1;:: :n ¡ 1g

­ n ½f1;:: :n ¡ 1gfQn ;n 2 Ng

Page 13: Fundamental Limitations of Networked Decision Systems

13

The World According to Agent 7

Page 14: Fundamental Limitations of Networked Decision Systems

14

Rationality

Rational Choice: Given information set agent chooses

Strategy profile:

Asymptotic Learning: Under what conditions does

I n n

¾n(I n) 2 arg maxy2f 0;1g

P (µ= yjI n) :

limn! 1 P¾(xn =µ) = 1

¾= f¾ng

Page 15: Fundamental Limitations of Networked Decision Systems

15

Equilibrium Decision Rule

The belief about the state decomposes into two parts

Private Belief,

Social belief,

Strategy profile is a perfect Bayesian equilibrium if and only if:¾

P¾(µ= 1jsn) +P¾(µ= 1j­ n ;xk for all k 2 ­ n) > 1=) ¾n(I n) = 1;

P¾(µ= 1jsn) +P¾(µ= 1j­ n ;xk for all k 2 ­ n) < 1=) ¾n(I n) = 0:

P¾(µ= 1j­ n;xk for all k 2 ­ n)

pn(sn) = P¾(µ= 1jsn) =µ1+

dF0(sn)dF1(sn)

¶ ¡ 1

Page 16: Fundamental Limitations of Networked Decision Systems

16

Selfish vs. Engineered Response: Star Topology (Cover)

Hypothesis testing:

If nodes communicate their observations:

What if nodes communicate only their decisions: xi = f (si )

L(¢) = Likelihood Ratio

P f1n

X

i

L(si ) ¡ EL(S) > dg · eng(d)

P f1n

X

i

L(xi ) ¡ EL(x) > dg · eng1(d)

Page 17: Fundamental Limitations of Networked Decision Systems

17

Selfishness and Herding Phenomenon: [Banerjee (92), BHW 92]

Setup: Full network: with probability 0.8

Absence­of­Collective­Wisdom

­ n = f1;2;:::;n ¡ 1g

Page 18: Fundamental Limitations of Networked Decision Systems

18

Private Beliefs

Private Beliefs

Definition: The private beliefs are called unbounded if

If the private beliefs are unbounded, then there exist some agents with beliefs arbitrarily close to 0 and other agents with beliefs arbitrarily close to 1.

Discrete example: with probability 0.8?

pn(sn) = P¾(µ= 1jsn) =µ1+

dF0(sn)dF1(sn)

¶ ¡ 1

:

sups2S

dF0(s)dF1(s)

= 1 and infs2S

dF0(s)dF1(s)

= 0

Page 19: Fundamental Limitations of Networked Decision Systems

19

Expanding Observations

Definition: A network topology is said to have expanding observations if for all , and all , there exists some such that for all

Conversely

fQngn2NK 2 R² > 0 N

n ¸ N

Qn

µmaxb2­ n

b< K¶< ²

Absence­of­Excessively­Influential­Agents

Page 20: Fundamental Limitations of Networked Decision Systems

20

Doyle, FrancisTannenbaum

VidyasagarAstrom/Murray

LjungKailath

New Book

New Book

New Book

New Book

No “learning”!

Influential References

Page 21: Fundamental Limitations of Networked Decision Systems

21

Summary

If then learning is impossible for signals with bounded beliefs Line network

It is possible to learn with expanding observations and bounded beliefs

Unbounded Beliefs Bounded BeliefsExpanding YES USUALLY NO,Observations SOMETIMES YES

Other Topologies NO NO

j­ n j · M

Page 22: Fundamental Limitations of Networked Decision Systems

22

Deterministic Networks: Examples

Full topology:

Line topology: ­ n = fn ¡ 1g

­ n = f1;2;:::;n ¡ 1g

Page 23: Fundamental Limitations of Networked Decision Systems

23

Examples: A Random Sample

Suppose each agent observes a sample of randomly drawn (uniformly) decisions from the past. If the private beliefs are unbounded, then asymptotic learning occurs.

C > 0

Page 24: Fundamental Limitations of Networked Decision Systems

24

Examples: Binomial Sample (Erdős–Rényi)

Suppose all links in the network are independent, and for two constants and we have

If the beliefs are unbounded and , asymptotic learning occurs

If , asymptotic learning does not occur

Qn(m2 ­ n) =AnB

;A B

B < 1

B ¸ 1

Page 25: Fundamental Limitations of Networked Decision Systems

25

Active Research Just scratching the surface….

Presented a simple model of information aggregation Private signal Network topology

More complex models for sequential decision making Dependent neighbors Heterogeneous preferences Multi-class agents Cyclic decisions

Rationality

Topology measures: depth, diameter, conductance Expanding observations Learning Rate

Robustness