Network formation by reinforcement learning: The long and medium run

Abstract

We investigate a simple stochastic model of social network formation by the process of reinforcement learning with discounting of the past. In the limit, for any value of the discounting parameter, small, stable cliques are formed. However, the time it takes to reach the limiting state in which cliques have formed is very sensitive to the discounting parameter. Depending on this value, the limiting result may or may not be a good predictor for realistic observation times.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,164

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Analytics

Added to PP
2009-12-05

Downloads
29 (#516,369)

6 months
7 (#328,545)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Brian Skyrms
University of California, Irvine

Citations of this work

Self-Assembling Networks.Jeffrey A. Barrett, Brian Skyrms & Aydin Mohseni - 2019 - British Journal for the Philosophy of Science 70 (1):1-25.
Self-Assembling Games and the Evolution of Salience.Jeffrey A. Barrett - 2023 - British Journal for the Philosophy of Science 74 (1):75-89.
Trust, risk, and the social contract.Brian Skyrms - 2008 - Synthese 160 (1):21-25.

View all 7 citations / Add more citations

References found in this work

No references found.

Add more references