English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The Category Game is a multi-agent model that accounts for the emergence ofshared categorization patterns in a population of interacting individuals. Inthe framework of the model, linguistic categories appear as long livedconsensus states that are constantly reshaped and re-negotiated by thecommunicating individuals. It is therefore crucial to investigate the long timebehavior to gain a clear understanding of the dynamics. However, it turns outthat the evolution of the emerging category system is so slow, already forsmall populations, that such an analysis has remained so far impossible. Here,we introduce a fast no-rejection algorithm for the Category Game thatdisentangles the physical simulation time from the CPU time, thus opening theway for thorough analysis of the model. We verify that the new algorithm isequivalent to the old one in terms of the emerging phenomenology and wequantify the CPU performances of the two algorithms, pointing out the neatadvantages offered by the no-rejection one. This technical advance has alreadyopened the way to new investigations of the model, thus helping to shed lighton the fundamental issue of categorization.

A fast no-rejection algorithm for the Category Game