Network formation by reinforcement learning: the long and medium run

DOI10.1016/J.MATHSOCSCI.2004.03.007MaRDI QIDQ1763191zbMATH OpenOpenAlexFDO

Authors Robin Pemantle, Brian Skyrms

Publication date 22 February 2005

Published in Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0404106, https://escholarship.org/uc/item/880951pv

zbMATH Keywords

Stochastic approximationUrn modelFriedmanExponential timeAbsorptionDiscountMeta-stablePotential wellQuasi-stableStag HuntThree-player gameTrap

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

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.

Recommendations

• A dynamic model of social network formation
• Distributed dynamic reinforcement of efficient outcomes in multiagent coordination and network formation
• Strategic learning and the topology of social networks
• A Noncooperative Model of Network Formation
• Stochastic stability in networks with decay

Cites work

• scientific article; zbMATH DE number 3148892 (Why is no real title available?)
• scientific article; zbMATH DE number 3152611 (Why is no real title available?)
• scientific article; zbMATH DE number 1405930 (Why is no real title available?)
• scientific article; zbMATH DE number 1444754 (Why is no real title available?)
• scientific article; zbMATH DE number 3109895 (Why is no real title available?)
• A dynamic model of social network formation
• Asymptotics of a matrix valued Markov chain arising in sociology.
• Attracting edge property for a class of reinforced random walks
• Dynamics of Morse-Smale urn processes
• Experience-weighted Attraction Learning in Normal Form Games
• Learning in extensive-form games: Experimental data and simple dynamic models in the intermediate term
• On learning to become a successful loser: A comparison of alternative abstractions of learning processes in the loss domain
• On the convergence of reinforcement learning
• Phase transition in reinforced random walk and RWRE on trees
• Recursive algorithms, urn processes and chaining number of chain recurrent sets
• Reinforced random walk
• Time to absorption in discounted reinforcement models.
• Vertex-reinforced random walk

Cited in

(9)

• Dynamic network formation with foresighted agents
• Time to absorption in discounted reinforcement models.
• VRRW on complete-like graphs: almost sure behavior
• Distributed dynamic reinforcement of efficient outcomes in multiagent coordination and network formation
• Wisdom of crowds versus groupthink: learning in groups and in isolation
• An infinite stochastic model of social network formation
• Interaction dynamics of two reinforcement learners
• The statistical properties of the threshold model and the feedback leadership condition
• Models of coalition or alliance formation

This page was built for publication: Network formation by reinforcement learning: the long and medium run

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1763191)