<a href="https://github.com/rbroc/cosearch"><img src="https://github.com/rbroc/cosearch/raw/master/img/simcat-logo-title.png" width="200" align="right" /></a>
# simcat: a Python package to Simulate Multi-agent Cognitive Association Tasks
![tests](https://github.com/rbroc/simcat/actions/workflows/run-tests.yml/badge.svg?event=push)
[![code style: black](https://img.shields.io/badge/Code%20Style-Black-black)](https://black.readthedocs.io/en/stable/the_black_code_style/current_style.html)
[![python version](https://img.shields.io/badge/Python-%3E=3.8-blue)](https://github.com/rbroc/simcat)
[![license: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)
This is a Python package to perform simulations of multi-agent cognitive association tasks (e.g., [the verbal fluency test](https://en.wikipedia.org/wiki/Verbal_fluency_test)).
The package makes it eary to instantiate one or more agents, endow them with a semantic memory, defined as a vector space that can be different across agents, and have agents perform association tasks in the form of a *verbal fluency tasks* either individually of following different interaction structures.
At present, the package includes two hard-coded rules:
1. Agents always name the item in their semantic space which has the lowest distance from the prompt (or has the strongest association, depending on options);
2. The simulation stops when all items in the semantic space have been named during a simulation, or when no items in the semantic space can be found, whose distance from the current prompt is lower than (or higher than, depending on options) a set threshold, passed as a parameter to the simulation.
These constraints could potentially be relaxed in future releases.
When multiple agents perform the association task together, they can interact following three possible turn-taking rules:
1. **Strict** turn-taking: agents alternate in naming the next item;
2. **Flexible** (or **collaborative**) turn-taking: agents are allowed to step in if the partner has no available associations from the current prompt;
3. **Shortest** (or **competitive**) turn-taking: the turn-holder is the agent with the shortest distance between the current prompt and the closest item in their semantic memory.
The package is tested for single-agent and two-agent interactions, but it supports interactions with more than two agents.
Furthermore, the package makes it possible to endow individual agents with basic forms of working memory, which make it possible to revert to previous prompts if no association from the current prompt is available.
For each simulation, a log of the entire association chain, including a range of metadata (e.g., the distance in semantic space between the prompt and the response item, or the density of the neighborhood in which named words are located), is produced and stored.
### :cherry_blossom: Applications
Applications of this framework include simulation of verbal fluency data, as well as computational studies investigating emergent properties of parameters such as **cognitive diversity** between agents and **turn-taking structures**.
A first study using this framework to investigate the effect of cognitive diversity on search behavior and performance in the association task was published in the proceedings of the 2022 Annual Meeting of the Cognitive Science Society (available at: https://escholarship.org/uc/item/58v5d82w):
```
@inproceedings{rocca2022cognitive,
title={Cognitive diversity promotes collective creativity: an agent-based simulation},
author={Rocca, Roberta and Tylén, Kristian},
booktitle={Proceedings of the Annual Meeting of the Cognitive Science Society},
volume={44},
number={44},
year={2022}
}
```
A follow-up involving comprehensive investigation of the effect of turn-taking structures and working memory flexibility is available as a preprint at: https://osf.io/preprints/psyarxiv/n3t6j, and currently under review.
```
@misc{rocca2024diversity,
title={The effect of diversity and social interaction on cognitive search: An agent-based simulation},
url={osf.io/preprints/psyarxiv/n3t6j},
author={Rocca, Roberta and Tylén, Kristian},
publishr={PsyArXiv},
year={2024},
}
```
Materials and documentation concerning this study are available under [`paper`](https://github.com/rbroc/simcat/tree/master/paper).
### :gear: Installation
We strongly recommend that you install `simcat` from pip:
`pip install simcat`
You can also install `simcat` from source by running:
`pip install git+https://github.com/rbroc/simcat.git`
or
```
git clone https://github.com/rbroc/simcat.git
cd simcat
pip3 install -e .
```
### :robot: :speech_balloon: Running a simulation
Once you have installed `simcat` can easily run a simulation with the following command:
```python
from simcat import Interaction, Agent
agent_1 = Agent(agent_name="agent_1", matrix_filename="sample/agent_1/matrix.tsv")
agent_2 = Agent(agent_name="agent_2", matrix_filename="sample/agent_2/matrix.tsv")
i = Interaction(
agents=[agent_1, agent_2],
save_folder="./sample/outs",
log_id="my_interaction",
nr_sim=2,
map_locations=False,
)
i.run_interaction(seeds=["cat", "dog"], interaction_type="strict", n_back=0)
```
<div class="table-wrapper" markdown="block">
### :floppy_disk: Simulation outputs
A csv file containing a log of the interaction will be saved, whose first rows will look like this:
| agent | turn | iter | seed | response | prob_a0 | prob_a1 | threshold | nr_sim | max_exchanges | init_seed | log_id | nr_agents | resp_knnd_5_a0 | resp_knnd_5_a0_current | avg_dist_remain_a0 | avg_knnd_5_a0 | var_knnd_5_a0 | resp_neighbors_a0 | resp_neighbors_a0_current | resp_knnd_5_a1 | resp_knnd_5_a1_current | avg_dist_remain_a1 | avg_knnd_5_a1 | var_knnd_5_a1 | resp_neighbors_a1 | resp_neighbors_a1_current |
|---------|------|------|-------------|-------------|---------|---------|-----------|--------|---------------|-----------|---------------|-----------|----------------|------------------------|--------------------|---------------|---------------|-------------------|---------------------------|----------------|------------------------|--------------------|---------------|---------------|-------------------|---------------------------|
| agent_1 | 0 | 0 | cat | dog | 0.00782 | 0.0113 | 0.01179 | 2 | 240 | cat | test_2_agents | 2 | 0.00982 | 0.0099 | 0.01274 | 0.011 | 0.00071 | 83 | 82 | 0.01053 | 0.01053 | 0.01273 | 0.01099 | 0.00072 | 70 | 69 |
| agent_2 | 1 | 0 | dog | lion | 0.01136 | 0.00891 | 0.01179 | 2 | 240 | cat | test_2_agents | 2 | 0.01066 | 0.01066 | 0.01274 | 0.011 | 0.00071 | 50 | 48 | 0.00989 | 0.01023 | 0.01274 | 0.011 | 0.00072 | 98 | 96 |
| agent_1 | 2 | 0 | lion | elephant | 0.00938 | 0.01264 | 0.01179 | 2 | 240 | cat | test_2_agents | 2 | 0.00987 | 0.01007 | 0.01274 | 0.01101 | 0.00071 | 81 | 78 | 0.01148 | 0.01148 | 0.01274 | 0.011 | 0.00072 | 10 | 10 |
| agent_2 | 3 | 0 | elephant | coral_snake | 0.01317 | 0.01026 | 0.01179 | 2 | 240 | cat | test_2_agents | 2 | 0.01019 | 0.01019 | 0.01274 | 0.01101 | 0.00071 | 46 | 46 | 0.01054 | 0.01076 | 0.01274 | 0.011 | 0.00072 | 44 | 42 |
| agent_1 | 4 | 0 | coral_snake | sea_snake | 0.00836 | 0.01368 | 0.01179 | 2 | 240 | cat | test_2_agents | 2 | 0.01045 | 0.01053 | 0.01274 | 0.01102 | 0.00071 | 66 | 65 | 0.01056 | 0.01056 | 0.01274 | 0.011 | 0.00072 | 27 | 26 |
| agent_2 | 5 | 0 | sea_snake | coyote | 0.0135 | 0.00919 | 0.01179 | 2 | 240 | cat | test_2_agents | 2 | 0.01071 | 0.01071 | 0.01274 | 0.01102 | 0.00071 | 69 | 67 | 0.01027 | 0.01036 | 0.01274 | 0.01101 | 0.00072 | 40 | 38 |
| agent_1 | 6 | 0 | coyote | rabbit | 0.00982 | 0.01201 | 0.01179 | 2 | 240 | cat | test_2_agents | 2 | 0.00987 | 0.01008 | 0.01275 | 0.01103 | 0.00071 | 91 | 86 | 0.01175 | 0.01175 | 0.01274 | 0.01101 | 0.00072 | 7 | 7 |
| agent_2 | 7 | 0 | rabbit | squid | 0.01257 | 0.01078 | 0.01179 | 2 | 240 | cat | test_2_agents | 2 | 0.00955 | 0.00955 | 0.01275 | 0.01103 | 0.0007 | 54 | 53 | 0.01083 | 0.01088 | 0.01274 | 0.01101 | 0.00073 | 54 | 50 |
| agent_1 | 8 | 0 | squid | cuttlefish | 0.00845 | 0.01253 | 0.01179 | 2 | 240 | cat | test_2_agents | 2 | 0.01011 | 0.01028 | 0.01275 | 0.01104 | 0.0007 | 53 | 50 | 0.0108 | 0.0108 | 0.01274 | 0.01101 | 0.00073 | 54 | 52 |
| agent_2 | 9 | 0 | cuttlefish | gull | 0.01311 | 0.01027 | 0.01179 | 2 | 240 | cat | test_2_agents | 2 | 0.01164 | 0.01166 | 0.01275 | 0.01104 | 0.0007 | 10 | 9 | 0.00982 | 0.00982 | 0.01274 | 0.01102 | 0.00072 | 83 | 78 |
</div>
The columns in the output refer to the following:
| **name** | **description** |
|------|-------------|
| `agent` | name of agent speaking |
| `turn` | turn number within the simulation |
| `iter` | simulation number |
| `seed` | seed at current turn |
| `response` | response to seed |
| `prob_a{n}` | Euclidean distance between seed and response in the n-th agent's space (Python indexing, therefore the index for the first agent is 0) |
| `threshold` | stopping threshold for the simulation |
| `nr_sim` | total number of simulations to run |
| `max_exchanges` | maximum number of turns within a simulation |
| `init_seed` | first seed in the simulation |
| `log_id` | id of the simulation, used in the logfile |
| `nr_agents` | number of agents |
| `resp_knnd_{k}_a{n}` | distance between the response and its k-th nearest neighbor (relative to the original semantic memory of the n-th agent) -- _k_ is passed as a parameter to the `Interaction` call. This is an index of neighborhood density. |
| `resp_knnd_{k}_a{n}_current` | same as above, but computed on the updated space (i.e., accounting only for items that have _not_ been named) |
| `avg_dist_remain_a{n}` | average Euclidean distance between each pair of items that have not _yet_ been named (relative to the semantic memory of the n-th agent). |
| `avg_knnd_{k}_a{n}` | Mean distance from k-th neighbor, for each item in the n-th agent's semantic space. Only items that have _not_ been named are considered. |
| `var_knnd_{k}_a{n}` | Std of the distance from k-th neighbor, for each item in the n-th agent's semantic space. Only items that have _not_ been named are considered. |
| `resp_neighbors_a{n}` | number of sub-threshold neighbors of the response item (relative to the semantic memory of the n-th agent) |
| `resp_neighbors_a{n}_current` | number of _remaining_ sub-threshold neighbors of the response item (relative to the semantic memory of the n-th agent). Items are dropped from agents' semantic space as they are named. |
### :hammer_and_wrench: Maintenance and development
Please feel free to contribute to this project. You can contribute to bug fixes :bug: or implement new functionality :seedling: by [opening a PR](https://github.com/rbroc/simcat/pulls) or [opening an issue](https://github.com/rbroc/simcat/issues).
You are also very welcome to contribute `docs`, which are not yet available.
### :file_folder: Project structure
```
simcat
├── LICENSE
├── pyproject.toml
├── README.md
├── img
├── paper
│ ├── README.md
│ ├── figures
│ ├── logs
│ ├── metrics
│ ├── models
│ ├── notebooks
│ └── scripts
├── sample
│ ├── agent_1
│ ├── agent_2
│ └── outs
├── src
│ └── simcat
└── tests
```
### :book: Citation
If you use this work, please cite:
```
@misc{rocca2024diversity,
title={The effect of diversity and social interaction on cognitive search: An agent-based simulation},
url={osf.io/preprints/psyarxiv/n3t6j},
author={Rocca, Roberta and Tylén, Kristian},
publishr={PsyArXiv},
year={2024},
}
```
Raw data
{
"_id": null,
"home_page": "",
"name": "simcat",
"maintainer": "",
"docs_url": null,
"requires_python": ">=3.8",
"maintainer_email": "",
"keywords": "cognition,social interaction,agent-based simulations,foraging,embedding models",
"author": "",
"author_email": "Roberta Rocca <rbrrcc@gmail.com>",
"download_url": "https://files.pythonhosted.org/packages/f1/c5/2f390b8f26c74ac6a3e27e019956010964033dd234e4eac8affe2c82d7c1/simcat-0.3.2.tar.gz",
"platform": null,
"description": "<a href=\"https://github.com/rbroc/cosearch\"><img src=\"https://github.com/rbroc/cosearch/raw/master/img/simcat-logo-title.png\" width=\"200\" align=\"right\" /></a>\n\n# simcat: a Python package to Simulate Multi-agent Cognitive Association Tasks\n![tests](https://github.com/rbroc/simcat/actions/workflows/run-tests.yml/badge.svg?event=push)\n[![code style: black](https://img.shields.io/badge/Code%20Style-Black-black)](https://black.readthedocs.io/en/stable/the_black_code_style/current_style.html)\n[![python version](https://img.shields.io/badge/Python-%3E=3.8-blue)](https://github.com/rbroc/simcat)\n[![license: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)\n\nThis is a Python package to perform simulations of multi-agent cognitive association tasks (e.g., [the verbal fluency test](https://en.wikipedia.org/wiki/Verbal_fluency_test)).\n\nThe package makes it eary to instantiate one or more agents, endow them with a semantic memory, defined as a vector space that can be different across agents, and have agents perform association tasks in the form of a *verbal fluency tasks* either individually of following different interaction structures.\nAt present, the package includes two hard-coded rules:\n1. Agents always name the item in their semantic space which has the lowest distance from the prompt (or has the strongest association, depending on options);\n2. The simulation stops when all items in the semantic space have been named during a simulation, or when no items in the semantic space can be found, whose distance from the current prompt is lower than (or higher than, depending on options) a set threshold, passed as a parameter to the simulation.\nThese constraints could potentially be relaxed in future releases.\n\nWhen multiple agents perform the association task together, they can interact following three possible turn-taking rules:\n1. **Strict** turn-taking: agents alternate in naming the next item;\n2. **Flexible** (or **collaborative**) turn-taking: agents are allowed to step in if the partner has no available associations from the current prompt;\n3. **Shortest** (or **competitive**) turn-taking: the turn-holder is the agent with the shortest distance between the current prompt and the closest item in their semantic memory.\nThe package is tested for single-agent and two-agent interactions, but it supports interactions with more than two agents.\nFurthermore, the package makes it possible to endow individual agents with basic forms of working memory, which make it possible to revert to previous prompts if no association from the current prompt is available.\n\nFor each simulation, a log of the entire association chain, including a range of metadata (e.g., the distance in semantic space between the prompt and the response item, or the density of the neighborhood in which named words are located), is produced and stored.\n\n### :cherry_blossom: Applications\nApplications of this framework include simulation of verbal fluency data, as well as computational studies investigating emergent properties of parameters such as **cognitive diversity** between agents and **turn-taking structures**.\n\nA first study using this framework to investigate the effect of cognitive diversity on search behavior and performance in the association task was published in the proceedings of the 2022 Annual Meeting of the Cognitive Science Society (available at: https://escholarship.org/uc/item/58v5d82w):\n```\n@inproceedings{rocca2022cognitive,\n title={Cognitive diversity promotes collective creativity: an agent-based simulation},\n author={Rocca, Roberta and Tyl\u00e9n, Kristian},\n booktitle={Proceedings of the Annual Meeting of the Cognitive Science Society},\n volume={44},\n number={44},\n year={2022}\n}\n```\n\nA follow-up involving comprehensive investigation of the effect of turn-taking structures and working memory flexibility is available as a preprint at: https://osf.io/preprints/psyarxiv/n3t6j, and currently under review.\n```\n@misc{rocca2024diversity,\n title={The effect of diversity and social interaction on cognitive search: An agent-based simulation},\n url={osf.io/preprints/psyarxiv/n3t6j},\n author={Rocca, Roberta and Tyl\u00e9n, Kristian},\n publishr={PsyArXiv},\n year={2024},\n}\n```\nMaterials and documentation concerning this study are available under [`paper`](https://github.com/rbroc/simcat/tree/master/paper). \n\n### :gear: Installation\nWe strongly recommend that you install `simcat` from pip:\n\n`pip install simcat`\n\nYou can also install `simcat` from source by running:\n\n`pip install git+https://github.com/rbroc/simcat.git`\n\nor\n\n```\ngit clone https://github.com/rbroc/simcat.git\ncd simcat\npip3 install -e .\n```\n\n### :robot: :speech_balloon: Running a simulation\nOnce you have installed `simcat` can easily run a simulation with the following command:\n\n```python\nfrom simcat import Interaction, Agent\n\nagent_1 = Agent(agent_name=\"agent_1\", matrix_filename=\"sample/agent_1/matrix.tsv\")\nagent_2 = Agent(agent_name=\"agent_2\", matrix_filename=\"sample/agent_2/matrix.tsv\")\n\ni = Interaction(\n agents=[agent_1, agent_2],\n save_folder=\"./sample/outs\",\n log_id=\"my_interaction\",\n nr_sim=2,\n map_locations=False,\n)\n\ni.run_interaction(seeds=[\"cat\", \"dog\"], interaction_type=\"strict\", n_back=0)\n```\n\n<div class=\"table-wrapper\" markdown=\"block\">\n\n### :floppy_disk: Simulation outputs\nA csv file containing a log of the interaction will be saved, whose first rows will look like this:\n \n\n| agent | turn | iter | seed | response | prob_a0 | prob_a1 | threshold | nr_sim | max_exchanges | init_seed | log_id | nr_agents | resp_knnd_5_a0 | resp_knnd_5_a0_current | avg_dist_remain_a0 | avg_knnd_5_a0 | var_knnd_5_a0 | resp_neighbors_a0 | resp_neighbors_a0_current | resp_knnd_5_a1 | resp_knnd_5_a1_current | avg_dist_remain_a1 | avg_knnd_5_a1 | var_knnd_5_a1 | resp_neighbors_a1 | resp_neighbors_a1_current |\n|---------|------|------|-------------|-------------|---------|---------|-----------|--------|---------------|-----------|---------------|-----------|----------------|------------------------|--------------------|---------------|---------------|-------------------|---------------------------|----------------|------------------------|--------------------|---------------|---------------|-------------------|---------------------------|\n| agent_1 | 0 | 0 | cat | dog | 0.00782 | 0.0113 | 0.01179 | 2 | 240 | cat | test_2_agents | 2 | 0.00982 | 0.0099 | 0.01274 | 0.011 | 0.00071 | 83 | 82 | 0.01053 | 0.01053 | 0.01273 | 0.01099 | 0.00072 | 70 | 69 |\n| agent_2 | 1 | 0 | dog | lion | 0.01136 | 0.00891 | 0.01179 | 2 | 240 | cat | test_2_agents | 2 | 0.01066 | 0.01066 | 0.01274 | 0.011 | 0.00071 | 50 | 48 | 0.00989 | 0.01023 | 0.01274 | 0.011 | 0.00072 | 98 | 96 |\n| agent_1 | 2 | 0 | lion | elephant | 0.00938 | 0.01264 | 0.01179 | 2 | 240 | cat | test_2_agents | 2 | 0.00987 | 0.01007 | 0.01274 | 0.01101 | 0.00071 | 81 | 78 | 0.01148 | 0.01148 | 0.01274 | 0.011 | 0.00072 | 10 | 10 |\n| agent_2 | 3 | 0 | elephant | coral_snake | 0.01317 | 0.01026 | 0.01179 | 2 | 240 | cat | test_2_agents | 2 | 0.01019 | 0.01019 | 0.01274 | 0.01101 | 0.00071 | 46 | 46 | 0.01054 | 0.01076 | 0.01274 | 0.011 | 0.00072 | 44 | 42 |\n| agent_1 | 4 | 0 | coral_snake | sea_snake | 0.00836 | 0.01368 | 0.01179 | 2 | 240 | cat | test_2_agents | 2 | 0.01045 | 0.01053 | 0.01274 | 0.01102 | 0.00071 | 66 | 65 | 0.01056 | 0.01056 | 0.01274 | 0.011 | 0.00072 | 27 | 26 |\n| agent_2 | 5 | 0 | sea_snake | coyote | 0.0135 | 0.00919 | 0.01179 | 2 | 240 | cat | test_2_agents | 2 | 0.01071 | 0.01071 | 0.01274 | 0.01102 | 0.00071 | 69 | 67 | 0.01027 | 0.01036 | 0.01274 | 0.01101 | 0.00072 | 40 | 38 |\n| agent_1 | 6 | 0 | coyote | rabbit | 0.00982 | 0.01201 | 0.01179 | 2 | 240 | cat | test_2_agents | 2 | 0.00987 | 0.01008 | 0.01275 | 0.01103 | 0.00071 | 91 | 86 | 0.01175 | 0.01175 | 0.01274 | 0.01101 | 0.00072 | 7 | 7 |\n| agent_2 | 7 | 0 | rabbit | squid | 0.01257 | 0.01078 | 0.01179 | 2 | 240 | cat | test_2_agents | 2 | 0.00955 | 0.00955 | 0.01275 | 0.01103 | 0.0007 | 54 | 53 | 0.01083 | 0.01088 | 0.01274 | 0.01101 | 0.00073 | 54 | 50 |\n| agent_1 | 8 | 0 | squid | cuttlefish | 0.00845 | 0.01253 | 0.01179 | 2 | 240 | cat | test_2_agents | 2 | 0.01011 | 0.01028 | 0.01275 | 0.01104 | 0.0007 | 53 | 50 | 0.0108 | 0.0108 | 0.01274 | 0.01101 | 0.00073 | 54 | 52 |\n| agent_2 | 9 | 0 | cuttlefish | gull | 0.01311 | 0.01027 | 0.01179 | 2 | 240 | cat | test_2_agents | 2 | 0.01164 | 0.01166 | 0.01275 | 0.01104 | 0.0007 | 10 | 9 | 0.00982 | 0.00982 | 0.01274 | 0.01102 | 0.00072 | 83 | 78 |\n\n</div>\n\nThe columns in the output refer to the following:\n| **name** | **description** |\n|------|-------------|\n| `agent` | name of agent speaking |\n| `turn` | turn number within the simulation |\n| `iter` | simulation number |\n| `seed` | seed at current turn |\n| `response` | response to seed |\n| `prob_a{n}` | Euclidean distance between seed and response in the n-th agent's space (Python indexing, therefore the index for the first agent is 0) |\n| `threshold` | stopping threshold for the simulation |\n| `nr_sim` | total number of simulations to run |\n| `max_exchanges` | maximum number of turns within a simulation |\n| `init_seed` | first seed in the simulation |\n| `log_id` | id of the simulation, used in the logfile |\n| `nr_agents` | number of agents |\n| `resp_knnd_{k}_a{n}` | distance between the response and its k-th nearest neighbor (relative to the original semantic memory of the n-th agent) -- _k_ is passed as a parameter to the `Interaction` call. This is an index of neighborhood density. |\n| `resp_knnd_{k}_a{n}_current` | same as above, but computed on the updated space (i.e., accounting only for items that have _not_ been named) |\n| `avg_dist_remain_a{n}` | average Euclidean distance between each pair of items that have not _yet_ been named (relative to the semantic memory of the n-th agent). |\n| `avg_knnd_{k}_a{n}` | Mean distance from k-th neighbor, for each item in the n-th agent's semantic space. Only items that have _not_ been named are considered. |\n| `var_knnd_{k}_a{n}` | Std of the distance from k-th neighbor, for each item in the n-th agent's semantic space. Only items that have _not_ been named are considered. |\n| `resp_neighbors_a{n}` | number of sub-threshold neighbors of the response item (relative to the semantic memory of the n-th agent) |\n| `resp_neighbors_a{n}_current` | number of _remaining_ sub-threshold neighbors of the response item (relative to the semantic memory of the n-th agent). Items are dropped from agents' semantic space as they are named. |\n\n### :hammer_and_wrench: Maintenance and development\nPlease feel free to contribute to this project. You can contribute to bug fixes :bug: or implement new functionality :seedling: by [opening a PR](https://github.com/rbroc/simcat/pulls) or [opening an issue](https://github.com/rbroc/simcat/issues).\nYou are also very welcome to contribute `docs`, which are not yet available.\n\n### :file_folder: Project structure\n```\nsimcat\n\u251c\u2500\u2500 LICENSE\n\u251c\u2500\u2500 pyproject.toml\n\u251c\u2500\u2500 README.md\n\u251c\u2500\u2500 img\n\u251c\u2500\u2500 paper \n\u2502 \u251c\u2500\u2500 README.md \n\u2502 \u251c\u2500\u2500 figures\n\u2502 \u251c\u2500\u2500 logs\n\u2502 \u251c\u2500\u2500 metrics\n\u2502 \u251c\u2500\u2500 models \n\u2502 \u251c\u2500\u2500 notebooks \n\u2502 \u2514\u2500\u2500 scripts\n\u251c\u2500\u2500 sample \n\u2502 \u251c\u2500\u2500 agent_1\n\u2502 \u251c\u2500\u2500 agent_2\n\u2502 \u2514\u2500\u2500 outs\n\u251c\u2500\u2500 src\n\u2502 \u2514\u2500\u2500 simcat\n\u2514\u2500\u2500 tests\n```\n\n### :book: Citation\n\nIf you use this work, please cite:\n```\n@misc{rocca2024diversity,\n title={The effect of diversity and social interaction on cognitive search: An agent-based simulation},\n url={osf.io/preprints/psyarxiv/n3t6j},\n author={Rocca, Roberta and Tyl\u00e9n, Kristian},\n publishr={PsyArXiv},\n year={2024},\n}\n```\n",
"bugtrack_url": null,
"license": "",
"summary": "A Python package to simulate multi-agent cognitive association tasks using embedding spaces",
"version": "0.3.2",
"project_urls": {
"Homepage": "https://github.com/rbroc/simcat",
"Issues": "https://github.com/rbroc/simcat/issues"
},
"split_keywords": [
"cognition",
"social interaction",
"agent-based simulations",
"foraging",
"embedding models"
],
"urls": [
{
"comment_text": "",
"digests": {
"blake2b_256": "dba659ad57bbd2438bf32dc6cb435f2b9c0b1811de98c4b330b5e077046398b8",
"md5": "a087ab1caf419c09509498668da79f29",
"sha256": "05f96307ad0b13d77648fd1e87d5700a95e4ff83a286735b35aa6eef87d49cd0"
},
"downloads": -1,
"filename": "simcat-0.3.2-py3-none-any.whl",
"has_sig": false,
"md5_digest": "a087ab1caf419c09509498668da79f29",
"packagetype": "bdist_wheel",
"python_version": "py3",
"requires_python": ">=3.8",
"size": 14237,
"upload_time": "2024-01-18T19:54:44",
"upload_time_iso_8601": "2024-01-18T19:54:44.558788Z",
"url": "https://files.pythonhosted.org/packages/db/a6/59ad57bbd2438bf32dc6cb435f2b9c0b1811de98c4b330b5e077046398b8/simcat-0.3.2-py3-none-any.whl",
"yanked": false,
"yanked_reason": null
},
{
"comment_text": "",
"digests": {
"blake2b_256": "f1c52f390b8f26c74ac6a3e27e019956010964033dd234e4eac8affe2c82d7c1",
"md5": "ffac858ae55f78b2a42dee57951be8d1",
"sha256": "92d6c44a7b7e7dd726ea5dea4910d3c1ed9311881fa6ef3d41f83f567ac8978c"
},
"downloads": -1,
"filename": "simcat-0.3.2.tar.gz",
"has_sig": false,
"md5_digest": "ffac858ae55f78b2a42dee57951be8d1",
"packagetype": "sdist",
"python_version": "source",
"requires_python": ">=3.8",
"size": 19067,
"upload_time": "2024-01-18T19:54:45",
"upload_time_iso_8601": "2024-01-18T19:54:45.766359Z",
"url": "https://files.pythonhosted.org/packages/f1/c5/2f390b8f26c74ac6a3e27e019956010964033dd234e4eac8affe2c82d7c1/simcat-0.3.2.tar.gz",
"yanked": false,
"yanked_reason": null
}
],
"upload_time": "2024-01-18 19:54:45",
"github": true,
"gitlab": false,
"bitbucket": false,
"codeberg": false,
"github_user": "rbroc",
"github_project": "simcat",
"travis_ci": false,
"coveralls": false,
"github_actions": true,
"lcname": "simcat"
}