Common Knowledge in Email Exchanges Krzysztof R. Apt CWI, - - PowerPoint PPT Presentation

common knowledge in email exchanges
SMART_READER_LITE
LIVE PREVIEW

Common Knowledge in Email Exchanges Krzysztof R. Apt CWI, - - PowerPoint PPT Presentation

Common Knowledge in Email Exchanges Krzysztof R. Apt CWI, Amsterdam, the Netherlands , University of Amsterdam based on joint work with Floor Sietsma, CWI Common Knowledge in Email Exchanges p. 1/2 History: Common, Knowledge COMMON,


slide-1
SLIDE 1

Common Knowledge in Email Exchanges

Krzysztof R. Apt

CWI, Amsterdam, the Netherlands, University of Amsterdam

based on joint work with

Floor Sietsma, CWI

Common Knowledge in Email Exchanges – p. 1/2

slide-2
SLIDE 2

History: Common, Knowledge

COMMON, something that belongs to all alike, in contradistiction to proper, peculiar. KNOWLEDGE is defined, by Mr Locke, to be the perception of the connection and agreement, or disagreement and repugnancy, or our ideas. Encyclopaedia Britannica By a Society of GENTLEMEN in Scotland Edinburgh MDCCLXXI

Common Knowledge in Email Exchanges – p. 2/2

slide-3
SLIDE 3

History: Nested Knowledge

  • A. Koestler, Arrow in the Blue, p. 75, 1952.
  • p. 192: “As for the diplomatic informer, he worked, of course for

the Deuxième Bureau, and the chief instructed us that we should carefully stick to the fiction that we didn’t know that he knew that we knew it.

Common Knowledge in Email Exchanges – p. 3/2

slide-4
SLIDE 4

History: Common Knowledge (1)

Morris Friedell, On the structure of shared awareness, Working Paper, 1967. p.2: “The final section, Economics, will deal with A thinks B thinks ... reasoning in formal games.”

  • A. Koestler, Arrow in the Blue, 1952.
  • p. 279: “It is common knowledge that if you plant a flag on a

hitherto uncharted island or territory, you have staked a claim to that territory on behalf of the nation which the flag represents.”

Common Knowledge in Email Exchanges – p. 4/2

slide-5
SLIDE 5
  • me History: Common Knowledge (2)

Common Knowledge in Email Exchanges – p. 5/2

slide-6
SLIDE 6

History: Email

Ray Tomlinson (BBN): 1971. Ted Meyer and Austin Henderson(BBN): BCC feature added in 1975.

Common Knowledge in Email Exchanges – p. 6/2

slide-7
SLIDE 7

Story 1: Why BCC is Useful

FYI: Wouter Bos knows Trijntje Oosterhuis. Source: Wouter Bos e-mailt per ongeluk zijn netwerk rond. NRC Handelsblad, 7th October 2010.

Common Knowledge in Email Exchanges – p. 7/2

slide-8
SLIDE 8

Story 2: Forwarding

I got an email from my Chinese postdoc Helen with a CC to her husband Bo.

Common Knowledge in Email Exchanges – p. 8/2

slide-9
SLIDE 9

Story 2: Forwarding

I got an email from my Chinese postdoc Helen with a CC to her husband Bo. I forwarded it to Floor.

Common Knowledge in Email Exchanges – p. 8/2

slide-10
SLIDE 10

Story 2: Forwarding

I got an email from my Chinese postdoc Helen with a CC to her husband Bo. I forwarded it to Floor. Floor replied to my forward to Bo and Helen with a BCC to me.

Common Knowledge in Email Exchanges – p. 8/2

slide-11
SLIDE 11

Story 2: Forwarding

I got an email from my Chinese postdoc Helen with a CC to her husband Bo. I forwarded it to Floor. Floor replied to my forward to Bo and Helen with a BCC to me. I forwarded the last email to Helen and Bo with a BCC to Floor.

Common Knowledge in Email Exchanges – p. 8/2

slide-12
SLIDE 12

Story 2: Forwarding

I got an email from my Chinese postdoc Helen with a CC to her husband Bo. I forwarded it to Floor. Floor replied to my forward to Bo and Helen with a BCC to me. I forwarded the last email to Helen and Bo with a BCC to Floor. Do we all have common knowledge of Floor’s reply?

Common Knowledge in Email Exchanges – p. 8/2

slide-13
SLIDE 13

Messages

Agents: finite set Ag, Notes: further unspecified.

s(i, l, G);

message containing note l, sent by agent i to group G,

f(i, l.m, G);

forwarding by i of message m with added note l, sent to group G,

S(m) = {sender of m}, R(m) = receivers of m.

Special cases: reply: f(i, l.m, G), with G = S(m), where i ∈ R(m), reply-all: f(i, l.m, G), with G = S(m) ∪ R(m), where i ∈ R(m).

Common Knowledge in Email Exchanges – p. 9/2

slide-14
SLIDE 14

Emails

Email: mB, with

m a message, B ⊆ Ag a set of BCC recipients.

Examples Passing a note further:

s(i, l, G)B, s(j, l, G′)B′, where j ∈ G ∪ B,

Forwarding an email:

mB, f(i, l.m, G)C, where i ∈ R(m) ∪ B,

Forwarding one’s own email:

mB, f(i, l.m, G)C, where S(m) = {i},

BCC reply-all (grrr . . .):

mB, f(i, l.m, G)C, where i ∈ B and G = S(m) ∪ R(m).

Common Knowledge in Email Exchanges – p. 10/2

slide-15
SLIDE 15

Modelling Story 2

I got an email from my Chinese postdoc Helen with a CC to her husband Bo.

e := m∅, where m := s(H, l, {B, K}),

Common Knowledge in Email Exchanges – p. 11/2

slide-16
SLIDE 16

Modelling Story 2

I got an email from my Chinese postdoc Helen with a CC to her husband Bo.

e := m∅, where m := s(H, l, {B, K}),

I forwarded it to Floor.

e′ := m′ ∅, where m′ := f(K, m, F),

Common Knowledge in Email Exchanges – p. 11/2

slide-17
SLIDE 17

Modelling Story 2

I got an email from my Chinese postdoc Helen with a CC to her husband Bo.

e := m∅, where m := s(H, l, {B, K}),

I forwarded it to Floor.

e′ := m′ ∅, where m′ := f(K, m, F),

Floor replied to my forward to Bo and Helen with a BCC to me.

e′′ := m′′

{K}, where m′′ := f(F, m′, {B, H}),

Common Knowledge in Email Exchanges – p. 11/2

slide-18
SLIDE 18

Modelling Story 2

I got an email from my Chinese postdoc Helen with a CC to her husband Bo.

e := m∅, where m := s(H, l, {B, K}),

I forwarded it to Floor.

e′ := m′ ∅, where m′ := f(K, m, F),

Floor replied to my forward to Bo and Helen with a BCC to me.

e′′ := m′′

{K}, where m′′ := f(F, m′, {B, H}),

I forwarded the last email to Helen and Bo with a BCC to Floor.

f(K, m′′, {H, B}){F}.

Common Knowledge in Email Exchanges – p. 11/2

slide-19
SLIDE 19

Assumptions

Each agent has his set of notes, can send/forward his notes, also can send/forward notes he received, also can forward messages he received.

Common Knowledge in Email Exchanges – p. 12/2

slide-20
SLIDE 20

Some Considerations

Are all sets of emails meaningful?

Common Knowledge in Email Exchanges – p. 13/2

slide-21
SLIDE 21

Some Considerations

Are all sets of emails meaningful? No: you can’t forward a note you did not receive.

Common Knowledge in Email Exchanges – p. 13/2

slide-22
SLIDE 22

Some Considerations

Are all sets of emails meaningful? No: you can’t forward a note you did not receive. If one sends/forwards somebody’s else note, then one should have received it.

Common Knowledge in Email Exchanges – p. 13/2

slide-23
SLIDE 23

Some Considerations

Are all sets of emails meaningful? No: you can’t forward a note you did not receive. If one sends/forwards somebody’s else note, then one should have received it. If one forwards a message, then one should have received it.

Common Knowledge in Email Exchanges – p. 13/2

slide-24
SLIDE 24

States

Factual information:

FI(s(i, l, G)) := {l}, FI(f(i, l.m, G)) := FI(m) ∪ {l}.

State: s = (E, L), where

E: set of emails, L = (L1, . . ., Lk): sets of agents’ notes.

Common Knowledge in Email Exchanges – p. 14/2

slide-25
SLIDE 25

Legal States

Legal state:

s = (E, L), such that for some partial ordering ≺ on E

for each s(i, l, G)B ∈ E, where l ∈ Li,

mC ∈ E exists such that mC ≺ s(i, l, G)B, i ∈ R(m) ∪ C and l ∈ FI(m),

Common Knowledge in Email Exchanges – p. 15/2

slide-26
SLIDE 26

Legal States

Legal state:

s = (E, L), such that for some partial ordering ≺ on E

for each s(i, l, G)B ∈ E, where l ∈ Li,

mC ∈ E exists such that mC ≺ s(i, l, G)B, i ∈ R(m) ∪ C and l ∈ FI(m),

for each f(i, l.m, G)B ∈ E, where l ∈ Li, some m′

C ∈ E exists such that

m′

C ≺ f(i, l.m, G)B, i ∈ R(m′) ∪ C and l ∈ FI(m′),

Common Knowledge in Email Exchanges – p. 16/2

slide-27
SLIDE 27

Legal States

Legal state:

s = (E, L), such that for some partial ordering ≺ on E

for each s(i, l, G)B ∈ E, where l ∈ Li,

mC ∈ E exists such that mC ≺ s(i, l, G)B, i ∈ R(m) ∪ C and l ∈ FI(m),

for each f(i, l.m, G)B ∈ E, where l ∈ Li, some m′

C ∈ E exists such that

m′

C ≺ f(i, l.m, G)B, i ∈ R(m′) ∪ C and l ∈ FI(m′),

for each f(i, l.m, G)B ∈ E some mC ∈ E exists such that

mC ≺ f(i, l.m, G)B and i ∈ S(m) ∪ R(m) ∪ C.

Common Knowledge in Email Exchanges – p. 17/2

slide-28
SLIDE 28

Language to Discuss Emails

ϕ ::= m | i ◭ m | ¬ϕ | ϕ ∧ ϕ

Abbreviation:

mB ::= m ∧

  • i∈S(m)∪R(m)∪B

i ◭ m ∧

  • i∈S(m)∪R(m)∪B

¬i ◭ m

Semantics Take s = (E, L).

s | = m

iff

∃B : mB ∈ E s | = i ◭ m

iff

∃B : mB ∈ E and i ∈ S(m) ∪ R(m) ∪ B s | = ¬ϕ

iff

s | = ϕ s | = ϕ ∧ ψ

iff

s | = ϕ and s | = ψ

Common Knowledge in Email Exchanges – p. 18/2

slide-29
SLIDE 29

Epistemic Language

Add CAϕ to the language discussing emails. Intuition: CAϕ iff group A commonly knows ϕ. Semantics Take s = (E, L).

s | = CAϕ

iff

s′ | = ϕ for any legal s′ s.t. s ∼A s′. ∼G is the reflexive, transitive closure of

i∈A ∼i.

How to define ∼i?

Common Knowledge in Email Exchanges – p. 19/2

slide-30
SLIDE 30

∼i Relation on Emails

mB ∼i m′

B′

iff

i ∈ S(m), B = B′ and m = m′, or i ∈ R(m) \ S(m) and m = m′, or i ∈ B ∩ B′ and m = m′.

Example If i ∈ B ∩ B′, then i cannot distinguish mB from m′

B′.

Common Knowledge in Email Exchanges – p. 20/2

slide-31
SLIDE 31

∼i Relation on Legal States

(E, L) ∼i (E′, L′)

iff

Li = L′

i,

∀mB ∈ E (i ∈ S(m) ∪ R(m) ∪ B → ∃mB′ ∈ E′ mB ∼i mB′), ∀mB′ ∈ E′ (i ∈ S(m) ∪ R(m) ∪ B′ → ∃mB ∈ E mB ∼i mB).

Common Knowledge in Email Exchanges – p. 21/2

slide-32
SLIDE 32

Common Knowledge of a Message

Theorem

s | = CAm iff

there is an email shared by the group A that proves the existence of m. Formally:

EA := {mB ∈ E | A ⊆ S(m)∪R(m) or ∃j ∈ B : (A ⊆ S(m)∪{j})}. EA is the set of emails that group A shared. s | = CAm iff ∃m′

B ∈ EA : m′ → m is valid.

Common Knowledge in Email Exchanges – p. 22/2

slide-33
SLIDE 33

Common Knowledge of an Email

Theorem Assume |A| ≥ 3.

s | = CAmB iff

there is an email shared by the group A that proves the existence of m,

s | = CAm iff ∃m′

B ∈ EA : m′ → m is valid.

for every agent j ∈ B there is an email shared by A that proves that j forwarded m,

∀j ∈ B ∃m′

B ∈ EA : m′ → j ◭ m is valid.

mB involves all agents,

Ag = S(m) ∪ R(m) ∪ B.

Common Knowledge in Email Exchanges – p. 23/2

slide-34
SLIDE 34

Conclusions Concerning Story 2

We have

s | = C{B,H,K,F}f(F, m′, {B, H}){K},

where

m′ := f(K, m, F), m := s(H, l, {B, K}).

I forwarded Floor’s reply to Helen and Bo with a BCC to Floor:

f(K, m′′, {H, B}){F},

where m′′ := f(F, m′, {B, H}), I should have forwarded Floor’s reply to Helen and Bo and Floor:

f(K, m′′, {H, B, F})∅.

Common Knowledge in Email Exchanges – p. 24/2

slide-35
SLIDE 35

Can one Simulate BCC?

Yes and No.

Common Knowledge in Email Exchanges – p. 25/2

slide-36
SLIDE 36

Can one Simulate BCC?

Yes and No. Yes:

mB ≡ m, f(i, m, j1), . . ., f(i, m, jk),

where S(m) = {i} and B = {j1, . . ., jk}.

Common Knowledge in Email Exchanges – p. 25/2

slide-37
SLIDE 37

Can one Simulate BCC?

Yes and No. Yes:

mB ≡ m, f(i, m, j1), . . ., f(i, m, jk),

where S(m) = {i} and B = {j1, . . ., jk}. No: the mailboxes of the BCC recipients differ. So for j ∈ B

mB, f(j, m, G) is legal, while m, f(i, m, j1), . . ., f(i, m, jk), f(j, m, G) not.

Common Knowledge in Email Exchanges – p. 25/2

slide-38
SLIDE 38

Can one Simulate BCC? (ctd)

Take state s with

Es = {s(1, l, 2){3}}.

Then s |

= K3¬K2K3s(1, l, 2).

Take the simulation state t. So

Et = {s(1, l, 2), f(1, s(1, l, 2), 3)}.

Then t |

= K3¬K2K3s(1, l, 2).

This observation can be made more general.

Common Knowledge in Email Exchanges – p. 26/2

slide-39
SLIDE 39

Current Research

Decidability of semantics. Sound and complete axiomatization. Operational semantics.

Common Knowledge in Email Exchanges – p. 27/2

slide-40
SLIDE 40

THANK YOU

Common Knowledge in Email Exchanges – p. 28/2

slide-41
SLIDE 41

Dzi˛ ekuj˛ e za uwag˛ e

Common Knowledge in Email Exchanges – p. 29/2