Pedestrian random walk in NetLogo (ch2.1)
PE
A collection of methods for random walk in NetLogo, including various movement restrictions, biases, and algorithm alternatives.
Updated 1 hour ago
1 4
Get started
Barter
A simple algorithm of barter with two interexchangeble goods.
1
mention
4
contributors
Description
A population of barters with initial amount of goods A and good B exchange each time step one unit of their most abundant good with a random partner in the opposite situation.
Inputs
| Name | Type | Description |
|---|---|---|
| num-barters | integer | The number of barters |
| max-initial-goods | integer | The maximum initial number of countable goods per barter agent |
Outputs
| Name | Type | Description |
|---|---|---|
| barter population | integer | The count of goods of type A or B (goodsA, goodsB) held per barter agent |
Mentions
Contributors
IR
Iza Romanowska
Author, Copyright Holder
0000-0002-9487-2111CW
Colin D. Wren
Author, Copyright Holder
0000-0003-4940-3997SC
Stefani A. Cabtree
Author, Copyright Holder
0000-0001-8585-8943AA
Andreas Angourakis
Creator, Contributor
0000-0002-9946-8142Member of community
