Gossip: Difference between revisions
From Santa Fe Institute Events Wiki
(New page: ==Gossip Project== '''Next project meeting 6: 30 Thursday''' ''Tuesday dinner meeting attendance: Mark Laidre, Anna Packenkina, Megan Olsen, Daniel Jones, Erika, Kaisa, Dan MacKinlay, S...) |
|||
(3 intermediate revisions by 3 users not shown) | |||
Line 1: | Line 1: | ||
==Gossip Project== | ==Gossip Project== | ||
==Abstract== | |||
Gossiping about complex systems: a network model of gossip assessment | |||
By The Santa Fe Gossip Group | |||
''Tuesday dinner meeting | Gossip—talking about third parties behind their back—is a uniquely human trait, one not found in any other species. We humans also spend a significant amount of our lives gossiping, with roughly one to two thirds of our conversation time focusing on gossip. While gossip can have positive functions (enabling listeners to keep track of others without first-hand observation) gossip is also problematic since it is susceptible to corruption. A key theoretical question is therefore how individuals can sort true from false gossip, using the true gossip to accurately reconstruct the going-ons within their community. Here we present a simulation model in which gossip propagates through a network of agents, some of whom distort information by propagating bogus gossip. We investigate the fitness of different decision-making rules for assessing the veracity of gossip and we provide preliminary results for how well these rules perform under different societal starting conditions. In the vein of Axelrod’s computer tournament on cooperation and Laland’s computer tournament on social learning we propose to undertake a computer tournament on gossip assessment. We hope you will submit a program. And may best gossiper win! | ||
'''Next project meeting 6: 30 Thursday after dinner''' | |||
''Tuesday dinner meeting: Mark Laidre, Anna Packenkina, Megan Olsen, Daniel Jones, Erika, Kaisa, Dan MacKinlay, Susanne Shultz'' | |||
Line 13: | Line 20: | ||
=== Project concept=== | === Project concept=== | ||
''' | '''Evolutionary dynamics models of gossip networks and honesty:''' | ||
# '''Social rules/norms and norms''' | # '''Social rules/norms and norms''' | ||
Line 39: | Line 46: | ||
## Can have reliable information | ## Can have reliable information | ||
## Extensions/additional parameters: Secondary rumours, memory, trust, Hebbian learning (mentioned but not sure in what context)??? | ## Extensions/additional parameters: Secondary rumours, memory, trust, Hebbian learning (mentioned but not sure in what context)??? | ||
# Fitness functions (per interaction/click?- | # Fitness functions (per interaction/click?- absolutely critical to define these, since they are core of model) | ||
## Target | ## Target | ||
## Honest signals | ## Honest signals | ||
Line 45: | Line 52: | ||
## Listeners | ## Listeners | ||
=== Related issues/models=== | === Related issues/models=== | ||
# Byzantine generals and traitors ( | # Byzantine generals and traitors | ||
# | ## lamport et all's [http://research.microsoft.com/en-us/um/people/lamport/pubs/byz.pdf classic paper] gives rigorous results about defector detection | ||
## Google's take [http://labs.google.com/papers/paxos_made_live.html on the complexity of their implementation] (i.e. people probably don't execute "thousands of lines of C++ code" when deciding who to believe) | |||
# Empirical tests? | |||
## Mafia Game ''(more information please)'' | ## Mafia Game ''(more information please)'' | ||
## Try to seed gossip statement and see how they travel through the network based on their 'importance' |
Latest revision as of 06:26, 25 June 2010
Gossip Project
Abstract
Gossiping about complex systems: a network model of gossip assessment
By The Santa Fe Gossip Group
Gossip—talking about third parties behind their back—is a uniquely human trait, one not found in any other species. We humans also spend a significant amount of our lives gossiping, with roughly one to two thirds of our conversation time focusing on gossip. While gossip can have positive functions (enabling listeners to keep track of others without first-hand observation) gossip is also problematic since it is susceptible to corruption. A key theoretical question is therefore how individuals can sort true from false gossip, using the true gossip to accurately reconstruct the going-ons within their community. Here we present a simulation model in which gossip propagates through a network of agents, some of whom distort information by propagating bogus gossip. We investigate the fitness of different decision-making rules for assessing the veracity of gossip and we provide preliminary results for how well these rules perform under different societal starting conditions. In the vein of Axelrod’s computer tournament on cooperation and Laland’s computer tournament on social learning we propose to undertake a computer tournament on gossip assessment. We hope you will submit a program. And may best gossiper win!
Next project meeting 6: 30 Thursday after dinner
Tuesday dinner meeting: Mark Laidre, Anna Packenkina, Megan Olsen, Daniel Jones, Erika, Kaisa, Dan MacKinlay, Susanne Shultz
Suggestions (SS): Could we have a stub with recommended papers either listed or uploaded? The following are my notes from the meeting, please comment/edit
Project concept
Evolutionary dynamics models of gossip networks and honesty:
- Social rules/norms and norms
- Use sociology gossip models
- Reliability may be a function of number of informants (the more confirmation of a piece of gossip, the more reliable the information)
- Help from sociology literature????
- How does bogus information/informants (false/distorted gossip) affect optimal rules
- Extensions: influence of positive versus negative information, in group versus outgroup impacts
- Use sociology gossip models
- Future possibilities?
- How does network structure impact on gossip dissemination?
- Parameterise models based on realistic networks
- How does gossip impact on stability of cooperation?
- Gossip and the evolution of language?
Model....
- Structure
- Graph versus agent-based models
- If there is no movement of ‘agents’, then it is probably better to use graphs.
- Network based model (use realistic parameters)
- Start with netlogo?
- Parameters
- Stable network
- Subgroup that has information about a third party
- Can propagate (at different levels)
- Can have reliable information
- Extensions/additional parameters: Secondary rumours, memory, trust, Hebbian learning (mentioned but not sure in what context)???
- Fitness functions (per interaction/click?- absolutely critical to define these, since they are core of model)
- Target
- Honest signals
- Bogus gossipers
- Listeners
Related issues/models
- Byzantine generals and traitors
- lamport et all's classic paper gives rigorous results about defector detection
- Google's take on the complexity of their implementation (i.e. people probably don't execute "thousands of lines of C++ code" when deciding who to believe)
- Empirical tests?
- Mafia Game (more information please)
- Try to seed gossip statement and see how they travel through the network based on their 'importance'