Optimal convergence in fame game with familiarity

Wang Yi-Ling and Zhang Gui-Qing

Chaos, Solitons & Fractals, 2013, vol. 56, issue C, 222-226

Abstract: A modified fame game is proposed by introducing familiarity between agents in the evolution process. We assume that since an agent is recommended, the forgotten probability by the taker decreases with the times that it has been recommended. At the same time, a tunable parameter is introduced to character the correlation between interaction strength and the familiarity. We find that there exists an optimal parameter value leading to the fastest convergence. We attribute this optimal phenomenon to the balance between the recommendation efficiency and the success rate of recommendation. Moreover, some other relevant characters, such as the time interval of forgetting each agent and the success rate of recommendation, are also investigated to understand the dynamics of the modified fame game.

Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077913001707
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:56:y:2013:i:c:p:222-226

DOI: 10.1016/j.chaos.2013.08.011

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().