An agent based model of the nash demand game in regular lattices

2Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © IFIP International Federation for Information Processing 2010.

Cite

CITATION STYLE

APA

Poza, D., Galán, J. M., Santos, J. I., & López-Paredes, A. (2010). An agent based model of the nash demand game in regular lattices. In IFIP Advances in Information and Communication Technology (Vol. 322 AICT, pp. 243–250). https://doi.org/10.1007/978-3-642-14341-0_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free