SlideShare a Scribd company logo
Groupwise information sharing
        promotes ingroup favoritism
           in indirect reciprocity
               Mitsuhiro Nakamura & Naoki Masuda
              Department of Mathematical Informatics
                   The University of Tokyo, Japan


M. Nakamura & N. Masuda. BMC Evol Biol 2012, 12:213
http:/www.biomedcentral.com/1471-2148/12/213           1
Indirect reciprocity
                       Alexander, Hamilton, Nowak & Sigmund

▶   A mechanism for sustaining cooperation

        Cost of help                  Benefit
                       !!     "#

                              "#
                                      Later, the cost of
                                     help is compensated
                                        by others’ help
                                                              2
What stabilizes cooperation
  in indirect reciprocity?
1. Apposite reputation assignment rules
2. Apposite sharing of reputation information
   in the population




                                                3
Reputation assignment rules
                   Image scoring (IM)

Donor’s action:                             Recipient’s
cooperation (C)          G    B             reputation:
or defection (D)                        good (G) or bad (B)
                    C    G   G
                    D    B    B

▶   C is good and D is bad
▶   Not ESS (Leimar & Hammerstein, Proc R Soc B 2001)
                                                              4
Reputation assignment rules
Simple standing (ST)           Stern judging (JG)

      G    B                       G   B      C toward a
                                             B player is B!
C     G    G                   C   G   B
D     B    G                   D   B   G
               D against a B               D against a B
                player is G                 player is G

▶   ESS (e.g., Ohtsuki & Iwasa, JTB 2004)                     5
What stabilizes cooperation
          in indirect reciprocity?
      1. Apposite reputation assignment rules
      2. Apposite sharing of reputation information in
         the population

             Incomplete            Group structure
         information sharing       (not well-mixed)
               ignored                 ignored

▶   We assumed groupwise information sharing and
    (unexpectedly) found the emergence of ingroup
    favoritism in indirect reciprocity                   6
Ingroup favoritism
                             Tajfel et al., 1971


▶   Humans help members in the same group (ingroup)
    more often than those in the other group
    (outgroup).
▶   Connection between ingroup favoritism and
    indirect reciprocity has been suggested by social
    psychologists (Mifune, Hashimoto & Yamagishi, Evol
    Hum Behav 2010)


                                                         7
Explanations for ingroup favoritism

▶   Green-beard effect (e.g., Jansen & van Baalen, Nature 2006)
▶   Tag mutation and limited dispersal (Fu et al., Sci Rep 2012)
▶   Gene-culture co-evolution (Ihara, Proc R Soc B 2007)
▶   Intergroup conflict (e.g., Choi & Bowles, Science 2007)
▶   Disease aversion (Faulkner et al., Group Proc Int Rel 2004)
▶   Direct reciprocity (Cosmides & Toobey, Ethol Sociobiol
    1989)
▶   Indirect Reciprocity (Yamagishi et al., Adv Group Proc 1999)
                                                                   8
Model
▶   Donation game in a group-
    structured population
    (ingroup game occurs with
    prob. θ)
                                              "$
▶   Observers in each group
    assign reputations to players
    based on a common               !!   "#

    assignment rule                                "#
                                         "#
▶   Observers assign wrong
    reputations with prob.
    µ << 1                                              9
Reputation dynamics

d                                                                       
                                                                           M
    () = − () +                      θ (  ) + (1 − θ)− (  )                    
                                                                             Φ  (σ ( )   )
d
                              ∈{GB}M                                       =1

  ▶     where,                                                                         r=(G,G,B)
 ()         Prob. that a player in group k has reputation vector r in
                                the eyes of M observers
                                                              Group 3
− () ≡               ()/(M − 1)
                                                                                       $

                                                                        Group 1             Group 2
                =                                                         !!   #

σ ()          Donor’s action: σ (G) = C σ (B) = D                               #        #



Φ (   )     Prob. that an observer assigns r when the observer
      scalar    observes action a toward recipient with reputation r’                              10
Ingroup reputation dynamics
d                                                                   
                                                                       M
    () = − () +                  θ (  ) + (1 − θ)− (  )                    
                                                                         Φ  (σ ( )   )
d
                          ∈{GB}M                                       =1




d                                                       
   in () = −in () +       θin ( ) + (1 − θ)out ( ) Φ (σ (  )   )
                                                       
d                         ∈{GB}




                                                                                            11
Outgroup reputation dynamics
d                                                                                   
                                                                                       M
    () = − () +                                  θ (  ) + (1 − θ)− (  )                    
                                                                                         Φ  (σ ( )   )
d
                                        ∈{GB}M                                                         =1



d                                              
   out () = −out () +
d
                                  ∈{GB}   ∈{GB}
                                                                                                                 
                                                       1                                 1
              θin (  )out (  ) + (1 − θ)           out (  )in (  ) + 1 −        out (  )out (  ) Φ (σ (  )   )
                                                     M −1                              M −1




                                                                                                                                      12
Results: Cooperativeness and ingroup bias
         Frac. G        Frac. G                     Ingroup
        (ingroup)     (outgroup)      Prob. C         bias


 Rule   ∗ (G)
         in            ∗ (G)
                        out              ψ             ρ
           1             1       1
 IM        2             2       2
                                                       0
                          1+θ      µ                   µ
 ST      1−µ          1−µ      1−
                           θ       θ                   θ
                         1    1+θ                    1
 JG      1−µ                      − µθ                 −µ
                         2     2                     2
               ψ ≡ θ∗ (G) + (1 − θ)∗ (G)
                     in              out     ρ ≡ ∗ (G) − ∗ (G)
                                                  in       out
                                                                   13
Results: Individual-based simulations
                                                                                                                                                            (a)
                                                                                                                                                                  1

                              IM                                                                                              ST                            ψ
                                                                                                                                                                                    ST, theory
     1.0




                                                                                       1.0
                                                                                                                                                                0.5                 ST, M = 2
                                                                                                                                                                                    ST, M = 10
     0.8




                                                                                       0.8
Player




                                                                                                                                                                Prob. C             JG, theory
     0.6




                                                                                       0.6                                                                                          JG, M = 2
     0.4




                                                                                       0.4




                                                                                                                                                                  0                 JG, M = 10
     0.2




                                                                                       0.2




                                                                                                                                                                      0       0.5            1
                                                                           JG
     0.0




                                                                                       0.0




                        Group
           −0.2   0.0   0.2   0.4   0.6   0.8      1.0         1.2                             −0.2         0.0         0.2   0.4   0.6   0.8   1.0   1.2




                                                                                                                                                                              θ
                                                                                                                                                            (b)
                                          1.0




                                                                                                                                                             0.5
                                          0.8




           G
                                          0.6




           B                                                                                                                                                ρ
                                          0.4




                                                                                                                                                            0.25
                                                                                                                                                                          Ingroup bias
                                          0.2
                                          0.0




                                                −0.2     0.0         0.2   0.4   0.6     0.8          1.0         1.2




    N=300, µ=.01,                                                                                                  N=103, µ=.01                                   0
     M=3, θ=.6                                                                                                                                                        0       0.5            1
                                                                                                                                                                                                 14
                                                                                                                                                                              θ
Results: Cases with error in actions
                                   (a)
                                         1

                                   ψ
▶   Donors fail in cooperation         0.5
                                                           ST, theory
                                                           ST,  = 0.01
    with prob. ε                       Prob. C
                                                           ST,  = 0.1
                                                           JG, theory
                                                           JG,  = 0.01
                                         0                 JG,  = 0.1

                                             0       0.5              1
                                                      θ
                                   (b)
                                    0.5

                                   ρ
                                   0.25
                                                 Ingroup bias

              N=103, µ=.01, M=10         0

                                             0       0.5              1
                                                                          15
                                                      θ
Results: Evolutionary stability
▶   Conditions under which players using reputations
    are stable against invasion by unconditional
    cooperators and defectors:
    ST
              1          public reputation: θ = 1
         1 
             1−θ         private reputation: θ → 1/M, M → ∞

    JG
            (M−1)(1+θ)         M−1                       1
          1+(M−3)θ+Mθ 2
                            1−Mθ      if 0 ≤ θ        M
            (M−1)(1+θ)
          1+(M−3)θ+Mθ 2
                                      if   1
                                              M   ≤θ≤1
                  1
             →        (M → ∞)
                  θ                                           16
Results: Mixed assignment rules
▶   Observers use JG with prob. α and ST with prob. 1-α
    a                                  b                             c
          1                                0.5                                 5
                                                                                    M2
                                                                                    Θ  0.6
     Ψ                                     Ρ                                   4




                                                                         bc
      0.5                                 0.25                                 3
                   M  2, Θ  0.6
                   M  , Θ  0.6
                   M  2, Θ  0.2                                              2
                   M  , Θ  0.2
          0                                    0                               1
           0             0.5         1          0             0.5    1          0             0.5    1
          ST              Α         JG         ST              Α    JG         ST              Α    JG

    d                                  e                             f
          5                                    5                               5
               M                                  M2                             M
               Θ  0.6                              Θ  0.2                         Θ  0.2
          4                                    4                               4
    bc




                                         bc




                                                                         bc
          3                                    3                               3

          2                                    2                               2

          1                                    1                               1
           0             0.5         1          0             0.5    1          0             0.5    1
          ST              Α         JG         ST              Α    JG         ST              Α    JG   17
Results: Heterogeneous assignment rules
▶    Different groups use different rules (either ST or JG)
                                 (a)                                      (b)
                                    1                                        1
                ψST , ψJG , ρST , ρJG
                                                ψST   ρST                            ψST   ρST
                                                ψJG   ρJG                            ψJG   ρJG
                                    0.5                                   0.5



                                        0                                   0

                                            0     2         4    6    8          0     5     10     15   20

                                 (c)                                      (d)
                                  0.2                           M=8        0.2                    M=20
                                                b=2                                  b=2
                                                b=4                                  b=4
                πJG − πST




                                    0.1         b=6                       0.1        b=6


                                        0                                   0

    Number of                  -0.1                                       -0.1
    JG groups                               0     2         4    6    8          0     5     10     15   20
                                                                                                              18
                                                        m                                    m
Conclusions


▶   Indirect reciprocity with group-structured
    information sharing yields ingroup favoritism.
▶   Ingroup bias is severer than under JG than under ST.




                                                           19

More Related Content

Similar to Ingroup favoritism under indirect reciprocity

Cooperation, Reputation & Gossiping
Cooperation, Reputation & GossipingCooperation, Reputation & Gossiping
Cooperation, Reputation & Gossiping
Vincent Traag
 
Kdd12 tutorial-inf-part-iv
Kdd12 tutorial-inf-part-ivKdd12 tutorial-inf-part-iv
Kdd12 tutorial-inf-part-ivLaks Lakshmanan
 
EuroSciPy 2019 - GANs: Theory and Applications
EuroSciPy 2019 - GANs: Theory and ApplicationsEuroSciPy 2019 - GANs: Theory and Applications
EuroSciPy 2019 - GANs: Theory and Applications
Emanuele Ghelfi
 
Hypothesis testings on individualized treatment rules
Hypothesis testings on individualized treatment rulesHypothesis testings on individualized treatment rules
Hypothesis testings on individualized treatment rules
Young-Geun Choi
 
GAN - Theory and Applications
GAN - Theory and ApplicationsGAN - Theory and Applications
GAN - Theory and Applications
Emanuele Ghelfi
 
Cooperation and Reputation
Cooperation and ReputationCooperation and Reputation
Cooperation and Reputation
Vincent Traag
 
Machine Learning Today: Current Research And Advances From AMLAB, UvA
Machine Learning Today: Current Research And Advances From AMLAB, UvAMachine Learning Today: Current Research And Advances From AMLAB, UvA
Machine Learning Today: Current Research And Advances From AMLAB, UvA
Advanced-Concepts-Team
 
Contracts with Interdependent Preferences (2)
Contracts with Interdependent Preferences (2)Contracts with Interdependent Preferences (2)
Contracts with Interdependent Preferences (2)
GRAPE
 
Contracts with interdependent preferences subtitle: Empathetic design
Contracts with interdependent preferences subtitle: Empathetic designContracts with interdependent preferences subtitle: Empathetic design
Contracts with interdependent preferences subtitle: Empathetic design
GRAPE
 
Speaker pham cong dinh
Speaker pham cong dinhSpeaker pham cong dinh
Speaker pham cong dinhAiTi Education
 
Generative adversarial networks
Generative adversarial networksGenerative adversarial networks
Generative adversarial networks
Kyuri Kim
 
Cooperation, Reputation & Gossiping
Cooperation, Reputation & GossipingCooperation, Reputation & Gossiping
Cooperation, Reputation & Gossiping
Vincent Traag
 
Cooperation, Reputation & Gossiping
Cooperation, Reputation & GossipingCooperation, Reputation & Gossiping
Cooperation, Reputation & Gossiping
Vincent Traag
 
Dynamics
DynamicsDynamics
Dynamics
urinadav
 
riken-RBlur-slides.pptx
riken-RBlur-slides.pptxriken-RBlur-slides.pptx
riken-RBlur-slides.pptx
MuhammadAhmedShah2
 
guenomu software -- model and agorithm in 2013
guenomu software -- model and agorithm in 2013guenomu software -- model and agorithm in 2013
guenomu software -- model and agorithm in 2013
Leonardo de Oliveira Martins
 
Review of generative adversarial nets
Review of generative adversarial netsReview of generative adversarial nets
Review of generative adversarial nets
SungminYou
 
Causal Inference Opening Workshop - Bayesian Nonparametric Models for Treatme...
Causal Inference Opening Workshop - Bayesian Nonparametric Models for Treatme...Causal Inference Opening Workshop - Bayesian Nonparametric Models for Treatme...
Causal Inference Opening Workshop - Bayesian Nonparametric Models for Treatme...
The Statistical and Applied Mathematical Sciences Institute
 
My presentation slides (3)
My presentation slides (3)My presentation slides (3)
My presentation slides (3)
Sajib Mahmud Tonmoy
 
Generalizing phylogenetics to infer patterns predicted by processes of divers...
Generalizing phylogenetics to infer patterns predicted by processes of divers...Generalizing phylogenetics to infer patterns predicted by processes of divers...
Generalizing phylogenetics to infer patterns predicted by processes of divers...
Jamie Oaks
 

Similar to Ingroup favoritism under indirect reciprocity (20)

Cooperation, Reputation & Gossiping
Cooperation, Reputation & GossipingCooperation, Reputation & Gossiping
Cooperation, Reputation & Gossiping
 
Kdd12 tutorial-inf-part-iv
Kdd12 tutorial-inf-part-ivKdd12 tutorial-inf-part-iv
Kdd12 tutorial-inf-part-iv
 
EuroSciPy 2019 - GANs: Theory and Applications
EuroSciPy 2019 - GANs: Theory and ApplicationsEuroSciPy 2019 - GANs: Theory and Applications
EuroSciPy 2019 - GANs: Theory and Applications
 
Hypothesis testings on individualized treatment rules
Hypothesis testings on individualized treatment rulesHypothesis testings on individualized treatment rules
Hypothesis testings on individualized treatment rules
 
GAN - Theory and Applications
GAN - Theory and ApplicationsGAN - Theory and Applications
GAN - Theory and Applications
 
Cooperation and Reputation
Cooperation and ReputationCooperation and Reputation
Cooperation and Reputation
 
Machine Learning Today: Current Research And Advances From AMLAB, UvA
Machine Learning Today: Current Research And Advances From AMLAB, UvAMachine Learning Today: Current Research And Advances From AMLAB, UvA
Machine Learning Today: Current Research And Advances From AMLAB, UvA
 
Contracts with Interdependent Preferences (2)
Contracts with Interdependent Preferences (2)Contracts with Interdependent Preferences (2)
Contracts with Interdependent Preferences (2)
 
Contracts with interdependent preferences subtitle: Empathetic design
Contracts with interdependent preferences subtitle: Empathetic designContracts with interdependent preferences subtitle: Empathetic design
Contracts with interdependent preferences subtitle: Empathetic design
 
Speaker pham cong dinh
Speaker pham cong dinhSpeaker pham cong dinh
Speaker pham cong dinh
 
Generative adversarial networks
Generative adversarial networksGenerative adversarial networks
Generative adversarial networks
 
Cooperation, Reputation & Gossiping
Cooperation, Reputation & GossipingCooperation, Reputation & Gossiping
Cooperation, Reputation & Gossiping
 
Cooperation, Reputation & Gossiping
Cooperation, Reputation & GossipingCooperation, Reputation & Gossiping
Cooperation, Reputation & Gossiping
 
Dynamics
DynamicsDynamics
Dynamics
 
riken-RBlur-slides.pptx
riken-RBlur-slides.pptxriken-RBlur-slides.pptx
riken-RBlur-slides.pptx
 
guenomu software -- model and agorithm in 2013
guenomu software -- model and agorithm in 2013guenomu software -- model and agorithm in 2013
guenomu software -- model and agorithm in 2013
 
Review of generative adversarial nets
Review of generative adversarial netsReview of generative adversarial nets
Review of generative adversarial nets
 
Causal Inference Opening Workshop - Bayesian Nonparametric Models for Treatme...
Causal Inference Opening Workshop - Bayesian Nonparametric Models for Treatme...Causal Inference Opening Workshop - Bayesian Nonparametric Models for Treatme...
Causal Inference Opening Workshop - Bayesian Nonparametric Models for Treatme...
 
My presentation slides (3)
My presentation slides (3)My presentation slides (3)
My presentation slides (3)
 
Generalizing phylogenetics to infer patterns predicted by processes of divers...
Generalizing phylogenetics to infer patterns predicted by processes of divers...Generalizing phylogenetics to infer patterns predicted by processes of divers...
Generalizing phylogenetics to infer patterns predicted by processes of divers...
 

Recently uploaded

Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdfSmart TV Buyer Insights Survey 2024 by 91mobiles.pdf
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf
91mobiles
 
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
Albert Hoitingh
 
PCI PIN Basics Webinar from the Controlcase Team
PCI PIN Basics Webinar from the Controlcase TeamPCI PIN Basics Webinar from the Controlcase Team
PCI PIN Basics Webinar from the Controlcase Team
ControlCase
 
Transcript: Selling digital books in 2024: Insights from industry leaders - T...
Transcript: Selling digital books in 2024: Insights from industry leaders - T...Transcript: Selling digital books in 2024: Insights from industry leaders - T...
Transcript: Selling digital books in 2024: Insights from industry leaders - T...
BookNet Canada
 
Essentials of Automations: Optimizing FME Workflows with Parameters
Essentials of Automations: Optimizing FME Workflows with ParametersEssentials of Automations: Optimizing FME Workflows with Parameters
Essentials of Automations: Optimizing FME Workflows with Parameters
Safe Software
 
UiPath Test Automation using UiPath Test Suite series, part 4
UiPath Test Automation using UiPath Test Suite series, part 4UiPath Test Automation using UiPath Test Suite series, part 4
UiPath Test Automation using UiPath Test Suite series, part 4
DianaGray10
 
Unsubscribed: Combat Subscription Fatigue With a Membership Mentality by Head...
Unsubscribed: Combat Subscription Fatigue With a Membership Mentality by Head...Unsubscribed: Combat Subscription Fatigue With a Membership Mentality by Head...
Unsubscribed: Combat Subscription Fatigue With a Membership Mentality by Head...
Product School
 
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
UiPathCommunity
 
Key Trends Shaping the Future of Infrastructure.pdf
Key Trends Shaping the Future of Infrastructure.pdfKey Trends Shaping the Future of Infrastructure.pdf
Key Trends Shaping the Future of Infrastructure.pdf
Cheryl Hung
 
FIDO Alliance Osaka Seminar: Overview.pdf
FIDO Alliance Osaka Seminar: Overview.pdfFIDO Alliance Osaka Seminar: Overview.pdf
FIDO Alliance Osaka Seminar: Overview.pdf
FIDO Alliance
 
FIDO Alliance Osaka Seminar: Passkeys at Amazon.pdf
FIDO Alliance Osaka Seminar: Passkeys at Amazon.pdfFIDO Alliance Osaka Seminar: Passkeys at Amazon.pdf
FIDO Alliance Osaka Seminar: Passkeys at Amazon.pdf
FIDO Alliance
 
GraphRAG is All You need? LLM & Knowledge Graph
GraphRAG is All You need? LLM & Knowledge GraphGraphRAG is All You need? LLM & Knowledge Graph
GraphRAG is All You need? LLM & Knowledge Graph
Guy Korland
 
State of ICS and IoT Cyber Threat Landscape Report 2024 preview
State of ICS and IoT Cyber Threat Landscape Report 2024 previewState of ICS and IoT Cyber Threat Landscape Report 2024 preview
State of ICS and IoT Cyber Threat Landscape Report 2024 preview
Prayukth K V
 
Epistemic Interaction - tuning interfaces to provide information for AI support
Epistemic Interaction - tuning interfaces to provide information for AI supportEpistemic Interaction - tuning interfaces to provide information for AI support
Epistemic Interaction - tuning interfaces to provide information for AI support
Alan Dix
 
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered Quality
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualitySoftware Delivery At the Speed of AI: Inflectra Invests In AI-Powered Quality
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered Quality
Inflectra
 
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...
Ramesh Iyer
 
JMeter webinar - integration with InfluxDB and Grafana
JMeter webinar - integration with InfluxDB and GrafanaJMeter webinar - integration with InfluxDB and Grafana
JMeter webinar - integration with InfluxDB and Grafana
RTTS
 
FIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdf
FIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdfFIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdf
FIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdf
FIDO Alliance
 
When stars align: studies in data quality, knowledge graphs, and machine lear...
When stars align: studies in data quality, knowledge graphs, and machine lear...When stars align: studies in data quality, knowledge graphs, and machine lear...
When stars align: studies in data quality, knowledge graphs, and machine lear...
Elena Simperl
 
Assuring Contact Center Experiences for Your Customers With ThousandEyes
Assuring Contact Center Experiences for Your Customers With ThousandEyesAssuring Contact Center Experiences for Your Customers With ThousandEyes
Assuring Contact Center Experiences for Your Customers With ThousandEyes
ThousandEyes
 

Recently uploaded (20)

Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdfSmart TV Buyer Insights Survey 2024 by 91mobiles.pdf
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf
 
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
 
PCI PIN Basics Webinar from the Controlcase Team
PCI PIN Basics Webinar from the Controlcase TeamPCI PIN Basics Webinar from the Controlcase Team
PCI PIN Basics Webinar from the Controlcase Team
 
Transcript: Selling digital books in 2024: Insights from industry leaders - T...
Transcript: Selling digital books in 2024: Insights from industry leaders - T...Transcript: Selling digital books in 2024: Insights from industry leaders - T...
Transcript: Selling digital books in 2024: Insights from industry leaders - T...
 
Essentials of Automations: Optimizing FME Workflows with Parameters
Essentials of Automations: Optimizing FME Workflows with ParametersEssentials of Automations: Optimizing FME Workflows with Parameters
Essentials of Automations: Optimizing FME Workflows with Parameters
 
UiPath Test Automation using UiPath Test Suite series, part 4
UiPath Test Automation using UiPath Test Suite series, part 4UiPath Test Automation using UiPath Test Suite series, part 4
UiPath Test Automation using UiPath Test Suite series, part 4
 
Unsubscribed: Combat Subscription Fatigue With a Membership Mentality by Head...
Unsubscribed: Combat Subscription Fatigue With a Membership Mentality by Head...Unsubscribed: Combat Subscription Fatigue With a Membership Mentality by Head...
Unsubscribed: Combat Subscription Fatigue With a Membership Mentality by Head...
 
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
 
Key Trends Shaping the Future of Infrastructure.pdf
Key Trends Shaping the Future of Infrastructure.pdfKey Trends Shaping the Future of Infrastructure.pdf
Key Trends Shaping the Future of Infrastructure.pdf
 
FIDO Alliance Osaka Seminar: Overview.pdf
FIDO Alliance Osaka Seminar: Overview.pdfFIDO Alliance Osaka Seminar: Overview.pdf
FIDO Alliance Osaka Seminar: Overview.pdf
 
FIDO Alliance Osaka Seminar: Passkeys at Amazon.pdf
FIDO Alliance Osaka Seminar: Passkeys at Amazon.pdfFIDO Alliance Osaka Seminar: Passkeys at Amazon.pdf
FIDO Alliance Osaka Seminar: Passkeys at Amazon.pdf
 
GraphRAG is All You need? LLM & Knowledge Graph
GraphRAG is All You need? LLM & Knowledge GraphGraphRAG is All You need? LLM & Knowledge Graph
GraphRAG is All You need? LLM & Knowledge Graph
 
State of ICS and IoT Cyber Threat Landscape Report 2024 preview
State of ICS and IoT Cyber Threat Landscape Report 2024 previewState of ICS and IoT Cyber Threat Landscape Report 2024 preview
State of ICS and IoT Cyber Threat Landscape Report 2024 preview
 
Epistemic Interaction - tuning interfaces to provide information for AI support
Epistemic Interaction - tuning interfaces to provide information for AI supportEpistemic Interaction - tuning interfaces to provide information for AI support
Epistemic Interaction - tuning interfaces to provide information for AI support
 
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered Quality
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualitySoftware Delivery At the Speed of AI: Inflectra Invests In AI-Powered Quality
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered Quality
 
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...
 
JMeter webinar - integration with InfluxDB and Grafana
JMeter webinar - integration with InfluxDB and GrafanaJMeter webinar - integration with InfluxDB and Grafana
JMeter webinar - integration with InfluxDB and Grafana
 
FIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdf
FIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdfFIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdf
FIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdf
 
When stars align: studies in data quality, knowledge graphs, and machine lear...
When stars align: studies in data quality, knowledge graphs, and machine lear...When stars align: studies in data quality, knowledge graphs, and machine lear...
When stars align: studies in data quality, knowledge graphs, and machine lear...
 
Assuring Contact Center Experiences for Your Customers With ThousandEyes
Assuring Contact Center Experiences for Your Customers With ThousandEyesAssuring Contact Center Experiences for Your Customers With ThousandEyes
Assuring Contact Center Experiences for Your Customers With ThousandEyes
 

Ingroup favoritism under indirect reciprocity

  • 1. Groupwise information sharing promotes ingroup favoritism in indirect reciprocity Mitsuhiro Nakamura & Naoki Masuda Department of Mathematical Informatics The University of Tokyo, Japan M. Nakamura & N. Masuda. BMC Evol Biol 2012, 12:213 http:/www.biomedcentral.com/1471-2148/12/213 1
  • 2. Indirect reciprocity Alexander, Hamilton, Nowak & Sigmund ▶ A mechanism for sustaining cooperation Cost of help Benefit !! "# "# Later, the cost of help is compensated by others’ help 2
  • 3. What stabilizes cooperation in indirect reciprocity? 1. Apposite reputation assignment rules 2. Apposite sharing of reputation information in the population 3
  • 4. Reputation assignment rules Image scoring (IM) Donor’s action: Recipient’s cooperation (C) G B reputation: or defection (D) good (G) or bad (B) C G G D B B ▶ C is good and D is bad ▶ Not ESS (Leimar & Hammerstein, Proc R Soc B 2001) 4
  • 5. Reputation assignment rules Simple standing (ST) Stern judging (JG) G B G B C toward a B player is B! C G G C G B D B G D B G D against a B D against a B player is G player is G ▶ ESS (e.g., Ohtsuki & Iwasa, JTB 2004) 5
  • 6. What stabilizes cooperation in indirect reciprocity? 1. Apposite reputation assignment rules 2. Apposite sharing of reputation information in the population Incomplete Group structure information sharing (not well-mixed) ignored ignored ▶ We assumed groupwise information sharing and (unexpectedly) found the emergence of ingroup favoritism in indirect reciprocity 6
  • 7. Ingroup favoritism Tajfel et al., 1971 ▶ Humans help members in the same group (ingroup) more often than those in the other group (outgroup). ▶ Connection between ingroup favoritism and indirect reciprocity has been suggested by social psychologists (Mifune, Hashimoto & Yamagishi, Evol Hum Behav 2010) 7
  • 8. Explanations for ingroup favoritism ▶ Green-beard effect (e.g., Jansen & van Baalen, Nature 2006) ▶ Tag mutation and limited dispersal (Fu et al., Sci Rep 2012) ▶ Gene-culture co-evolution (Ihara, Proc R Soc B 2007) ▶ Intergroup conflict (e.g., Choi & Bowles, Science 2007) ▶ Disease aversion (Faulkner et al., Group Proc Int Rel 2004) ▶ Direct reciprocity (Cosmides & Toobey, Ethol Sociobiol 1989) ▶ Indirect Reciprocity (Yamagishi et al., Adv Group Proc 1999) 8
  • 9. Model ▶ Donation game in a group- structured population (ingroup game occurs with prob. θ) "$ ▶ Observers in each group assign reputations to players based on a common !! "# assignment rule "# "# ▶ Observers assign wrong reputations with prob. µ << 1 9
  • 10. Reputation dynamics d M () = − () + θ ( ) + (1 − θ)− ( ) Φ (σ ( ) ) d ∈{GB}M =1 ▶ where, r=(G,G,B) () Prob. that a player in group k has reputation vector r in the eyes of M observers Group 3 − () ≡ ()/(M − 1) $ Group 1 Group 2 = !! # σ () Donor’s action: σ (G) = C σ (B) = D # # Φ ( ) Prob. that an observer assigns r when the observer scalar observes action a toward recipient with reputation r’ 10
  • 11. Ingroup reputation dynamics d M () = − () + θ ( ) + (1 − θ)− ( ) Φ (σ ( ) ) d ∈{GB}M =1 d in () = −in () + θin ( ) + (1 − θ)out ( ) Φ (σ ( ) ) d ∈{GB} 11
  • 12. Outgroup reputation dynamics d M () = − () + θ ( ) + (1 − θ)− ( ) Φ (σ ( ) ) d ∈{GB}M =1 d out () = −out () + d ∈{GB} ∈{GB} 1 1 θin ( )out ( ) + (1 − θ) out ( )in ( ) + 1 − out ( )out ( ) Φ (σ ( ) ) M −1 M −1 12
  • 13. Results: Cooperativeness and ingroup bias Frac. G Frac. G Ingroup (ingroup) (outgroup) Prob. C bias Rule ∗ (G) in ∗ (G) out ψ ρ 1 1 1 IM 2 2 2 0 1+θ µ µ ST 1−µ 1−µ 1− θ θ θ 1 1+θ 1 JG 1−µ − µθ −µ 2 2 2 ψ ≡ θ∗ (G) + (1 − θ)∗ (G) in out ρ ≡ ∗ (G) − ∗ (G) in out 13
  • 14. Results: Individual-based simulations (a) 1 IM ST ψ ST, theory 1.0 1.0 0.5 ST, M = 2 ST, M = 10 0.8 0.8 Player Prob. C JG, theory 0.6 0.6 JG, M = 2 0.4 0.4 0 JG, M = 10 0.2 0.2 0 0.5 1 JG 0.0 0.0 Group −0.2 0.0 0.2 0.4 0.6 0.8 1.0 1.2 −0.2 0.0 0.2 0.4 0.6 0.8 1.0 1.2 θ (b) 1.0 0.5 0.8 G 0.6 B ρ 0.4 0.25 Ingroup bias 0.2 0.0 −0.2 0.0 0.2 0.4 0.6 0.8 1.0 1.2 N=300, µ=.01, N=103, µ=.01 0 M=3, θ=.6 0 0.5 1 14 θ
  • 15. Results: Cases with error in actions (a) 1 ψ ▶ Donors fail in cooperation 0.5 ST, theory ST, = 0.01 with prob. ε Prob. C ST, = 0.1 JG, theory JG, = 0.01 0 JG, = 0.1 0 0.5 1 θ (b) 0.5 ρ 0.25 Ingroup bias N=103, µ=.01, M=10 0 0 0.5 1 15 θ
  • 16. Results: Evolutionary stability ▶ Conditions under which players using reputations are stable against invasion by unconditional cooperators and defectors: ST 1 public reputation: θ = 1 1 1−θ private reputation: θ → 1/M, M → ∞ JG (M−1)(1+θ) M−1 1 1+(M−3)θ+Mθ 2 1−Mθ if 0 ≤ θ M (M−1)(1+θ) 1+(M−3)θ+Mθ 2 if 1 M ≤θ≤1 1 → (M → ∞) θ 16
  • 17. Results: Mixed assignment rules ▶ Observers use JG with prob. α and ST with prob. 1-α a b c 1 0.5 5 M2 Θ 0.6 Ψ Ρ 4 bc 0.5 0.25 3 M 2, Θ 0.6 M , Θ 0.6 M 2, Θ 0.2 2 M , Θ 0.2 0 0 1 0 0.5 1 0 0.5 1 0 0.5 1 ST Α JG ST Α JG ST Α JG d e f 5 5 5 M M2 M Θ 0.6 Θ 0.2 Θ 0.2 4 4 4 bc bc bc 3 3 3 2 2 2 1 1 1 0 0.5 1 0 0.5 1 0 0.5 1 ST Α JG ST Α JG ST Α JG 17
  • 18. Results: Heterogeneous assignment rules ▶ Different groups use different rules (either ST or JG) (a) (b) 1 1 ψST , ψJG , ρST , ρJG ψST ρST ψST ρST ψJG ρJG ψJG ρJG 0.5 0.5 0 0 0 2 4 6 8 0 5 10 15 20 (c) (d) 0.2 M=8 0.2 M=20 b=2 b=2 b=4 b=4 πJG − πST 0.1 b=6 0.1 b=6 0 0 Number of -0.1 -0.1 JG groups 0 2 4 6 8 0 5 10 15 20 18 m m
  • 19. Conclusions ▶ Indirect reciprocity with group-structured information sharing yields ingroup favoritism. ▶ Ingroup bias is severer than under JG than under ST. 19