Search arXivSearch

arXiv · 1411.4885

The working group performance modeled by a bi-layer cellular automaton

Abstract

The problem `human and work' in a model working group is investigated by means of cellular automata technique. Attitude of members of a group towards work is measured by an indicator of loyalty to the group (the number of agents who carry out their tasks), and lack of loyalty (the number of agents, who give their tasks to other agents). Initially, all agents realize scheduled tasks one-by-one. Agents with the number of scheduled tasks larger than a given threshold change their strategy to unloyal one and start avoiding completing tasks by passing them to their colleagues. Optionally, in some conditions, we allow agents to return to loyal state; hence the rule is hysteretic. Results are presented on an influence of i) the density of tasks, ii) the threshold number of tasks assigned to the agents' forcing him/her for strategy change on the system efficiency. We show that a `black' scenario of the system stacking in a `jammed phase' (with all agents preferring unloyal strategy and having plenty tasks scheduled for realization) may be avoided when return to loyalty is allowed and either i) the number of agents chosen for task realization, or ii) the number of assigned tasks, or iii) the threshold value of assigned tasks, which force the agent to conversion from loyal strategy to unloyal one, or iv) the threshold value of tasks assigned to unloyal agent, which force him/her to task redistribution among his/her neighbors, are smartly chosen.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Krzysztof Malarz, Agnieszka Kowalska-Styczeń, Krzysztof Kułakowski. 2015-07-03. The working group performance modeled by a bi-layer cellular automaton. https://doi.org/10.1177/0037549715614096

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Dimension-dependent continuum limits in tissue mechanics

Continuum descriptions of epithelial tissue mechanics can replace expensive individual-based simulations with tractable macroscopic models, yet the link between cell-scale forces and tissue-scale transport remains poorly understood. We show that dimensionality controls this link: long-time mechanical relaxation rates reveal generalized porous-media-type nonlinear transport phenomena, $D(ρ)\proptoρ^γ$. Exponents in nonlinear diffusivities are fixed by microscopic mechanics and dimensionality, providing a novel physical mechanism for emergent macroscopic transport phenomena.

nlin.CG

Gliders on Aperiodic Monotilings: Cellular Automata on the Hat and Spectre

The hat and spectre monotiles, discovered in 2023, tile the plane only aperiodically; no cellular automaton dynamics on these tilings has previously been reported. Cellular automata are studied here on patches generated by finite-state transducers, so that every experiment regenerates deterministically from a small record. Within edge-adjacency semi-totalistic rules, exhaustive and evolutionary searches find only mortal travelers: gliders are absent. Guided by a reproduction of the known Penrose-tiling glider, the rule space is extended to vertex neighborhoods and to priority-table rules whose non-quiescent states are visible to neighbors. Evolutionary search then discovers gliders on both monotilings; tracked by a sliding window that regenerates the patch along the flight, they travel one million rings at constant speed and heading. All headings are quantized, to millidegrees, onto a six-spoke compass - the fast axes of the tiling's graph metric. An ablation shows both rule-space extensions are individually necessary. All results replay exactly in an accompanying interactive essay.

nlin.CG

Diagonal Bases and Diagonal Periods of Elementary Cellular Automata

Which cellular-automaton diagonal families form bases in every finite window? For canonical polynomial lifts of elementary rules, two truth-table bits determine triangularity, and units on the matrix diagonal determine invertibility. Exactly 24 rules give universal binary bases; all remain universal over every modulus. Among triangular binary coordinate maps, the Pascal transform is uniquely characterized by converting OR convolution into pointwise multiplication, while increment becomes strict prefix summation. Explicit inverses and coordinate comparisons distinguish sparsity from evaluation cost. A Rule 30 polynomial construction gives Fibonacci bounds on interpolation order and prime-modulus periods. Exact additive periods anchor a finite census modulo two and three. These results separate all-window basis classification from optimization of a representation and from period patterns observed in finite windows.

nlin.CG