An Agent Based Model of the Nash Demand Game in Regular Lattices - Balanced Automation Systems for Future Manufacturing Networks
Conference Papers Year : 2010

An Agent Based Model of the Nash Demand Game in Regular Lattices

Abstract

In this work we propose an agent based model where a fixed finite population of tagged agents play iteratively the Nash demand game in a regular lattice. This work extends the multiagent bargaining model by [1] including the spatial dimension in the game. Each agent is endowed with memory and plays the best reply against the opponent's most frequent demand. The results show that all the possible persistent regimes of the global interaction game can also be obtained with this spatial version. Our preliminary analysis also suggests that the topological distribution of the agents can generate new persistent regimes within groups of agents with the same tag.
Fichier principal
Vignette du fichier
PozaGSL10.pdf (400.48 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01060729 , version 1 (16-11-2017)

Licence

Identifiers

Cite

David Poza, José Manuel Galán, José Ignacio Santos, Adolfo López-Paredes. An Agent Based Model of the Nash Demand Game in Regular Lattices. 9th IFIP WG 5.5 International Conference on Balanced Automation Systems for Future Manufacturing Networks (BASYS), Jul 2010, Valencia, Spain. pp.243-250, ⟨10.1007/978-3-642-14341-0_28⟩. ⟨hal-01060729⟩
80 View
72 Download

Altmetric

Share

More