This is an agent-based model of bargaining in regular lattices based on the original tag model proposed by Axtell et al. [1]. Our model introduces a spatial restriction in the structure of interactions: agents are embedded on a regular lattice and they can only bargain with their spatial neighbours. In each time period of the model, each agent selects one of her neighbours at random to play the Nash demand game. When playing the game, each agent considers three possible demands of a pie (which is a metaphor of something that is going to be shared between two persons), i.e. low (L) or 30%, medium (M) or 50% and high (H) or 70%. The agents get the chosen demand if the sum of their demands does not exceed 100 percent of the pie; otherwise they both get nothing.
[1] Bargaining Model. In: Durlauf SN, Young HP, editors. Social Dynamics. Cambridge, Mass./Washington, D.C.: MIT Press. pp. 191–211.

This is a companion discussion topic for the original entry at https://www.comses.net/codebases/5425/releases/1.0.0/