Distributed techniques for frozen and dynamic multi-agent games

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The classical Minority Game (MG) involves n agents (n being an odd integer) that need to take a binary action at discrete time-steps. Each agent's goal is to be rewarded at every time-step for taking the minority action with respect to the entire agent population. Otherwise it is punished. Agents cannot explicitly communicate with each other and only have access to the number of agents that took a particular action in the last m time-steps. In the Local Minority Game (LMG) agents aim to be in the minority of their immediate neighbors. We have solved the LMG using the Distributed Stochastic Algorithm (DSA). This leads the agent system to a frozen configuration where agents do not change their states over time. We also present a dynamic version of the LMG and its extension to an application in sensor networks, both of which we model as a Random Boolean Network (RBN).

Original languageEnglish (US)
Title of host publicationProceedings - International Conference on Computational Intelligence for Modelling, Control and Automation, CIMCA 2005 and International Conference on Intelligent Agents, Web Technologies and Internet
Pages341-347
Number of pages7
Volume2
StatePublished - 2005
EventInternational Conference on Computational Intelligence for Modelling, Control and Automation, CIMCA 2005 and International Conference on Intelligent Agents, Web Technologies and Internet Commerce, IAWTIC 2005 - Vienna, Austria
Duration: Nov 28 2005Nov 30 2005

Other

OtherInternational Conference on Computational Intelligence for Modelling, Control and Automation, CIMCA 2005 and International Conference on Intelligent Agents, Web Technologies and Internet Commerce, IAWTIC 2005
CountryAustria
CityVienna
Period11/28/0511/30/05

Fingerprint

Sensor networks

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Chachra, S., & Marefat, M. M. (2005). Distributed techniques for frozen and dynamic multi-agent games. In Proceedings - International Conference on Computational Intelligence for Modelling, Control and Automation, CIMCA 2005 and International Conference on Intelligent Agents, Web Technologies and Internet (Vol. 2, pp. 341-347). [1631492]

Distributed techniques for frozen and dynamic multi-agent games. / Chachra, Sumit; Marefat, Michael Mahmoud.

Proceedings - International Conference on Computational Intelligence for Modelling, Control and Automation, CIMCA 2005 and International Conference on Intelligent Agents, Web Technologies and Internet. Vol. 2 2005. p. 341-347 1631492.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chachra, S & Marefat, MM 2005, Distributed techniques for frozen and dynamic multi-agent games. in Proceedings - International Conference on Computational Intelligence for Modelling, Control and Automation, CIMCA 2005 and International Conference on Intelligent Agents, Web Technologies and Internet. vol. 2, 1631492, pp. 341-347, International Conference on Computational Intelligence for Modelling, Control and Automation, CIMCA 2005 and International Conference on Intelligent Agents, Web Technologies and Internet Commerce, IAWTIC 2005, Vienna, Austria, 11/28/05.
Chachra S, Marefat MM. Distributed techniques for frozen and dynamic multi-agent games. In Proceedings - International Conference on Computational Intelligence for Modelling, Control and Automation, CIMCA 2005 and International Conference on Intelligent Agents, Web Technologies and Internet. Vol. 2. 2005. p. 341-347. 1631492
Chachra, Sumit ; Marefat, Michael Mahmoud. / Distributed techniques for frozen and dynamic multi-agent games. Proceedings - International Conference on Computational Intelligence for Modelling, Control and Automation, CIMCA 2005 and International Conference on Intelligent Agents, Web Technologies and Internet. Vol. 2 2005. pp. 341-347
@inproceedings{7bd1cdc0054b4d39926903eb7c2ad6b8,
title = "Distributed techniques for frozen and dynamic multi-agent games",
abstract = "The classical Minority Game (MG) involves n agents (n being an odd integer) that need to take a binary action at discrete time-steps. Each agent's goal is to be rewarded at every time-step for taking the minority action with respect to the entire agent population. Otherwise it is punished. Agents cannot explicitly communicate with each other and only have access to the number of agents that took a particular action in the last m time-steps. In the Local Minority Game (LMG) agents aim to be in the minority of their immediate neighbors. We have solved the LMG using the Distributed Stochastic Algorithm (DSA). This leads the agent system to a frozen configuration where agents do not change their states over time. We also present a dynamic version of the LMG and its extension to an application in sensor networks, both of which we model as a Random Boolean Network (RBN).",
author = "Sumit Chachra and Marefat, {Michael Mahmoud}",
year = "2005",
language = "English (US)",
isbn = "0769525040",
volume = "2",
pages = "341--347",
booktitle = "Proceedings - International Conference on Computational Intelligence for Modelling, Control and Automation, CIMCA 2005 and International Conference on Intelligent Agents, Web Technologies and Internet",

}

TY - GEN

T1 - Distributed techniques for frozen and dynamic multi-agent games

AU - Chachra, Sumit

AU - Marefat, Michael Mahmoud

PY - 2005

Y1 - 2005

N2 - The classical Minority Game (MG) involves n agents (n being an odd integer) that need to take a binary action at discrete time-steps. Each agent's goal is to be rewarded at every time-step for taking the minority action with respect to the entire agent population. Otherwise it is punished. Agents cannot explicitly communicate with each other and only have access to the number of agents that took a particular action in the last m time-steps. In the Local Minority Game (LMG) agents aim to be in the minority of their immediate neighbors. We have solved the LMG using the Distributed Stochastic Algorithm (DSA). This leads the agent system to a frozen configuration where agents do not change their states over time. We also present a dynamic version of the LMG and its extension to an application in sensor networks, both of which we model as a Random Boolean Network (RBN).

AB - The classical Minority Game (MG) involves n agents (n being an odd integer) that need to take a binary action at discrete time-steps. Each agent's goal is to be rewarded at every time-step for taking the minority action with respect to the entire agent population. Otherwise it is punished. Agents cannot explicitly communicate with each other and only have access to the number of agents that took a particular action in the last m time-steps. In the Local Minority Game (LMG) agents aim to be in the minority of their immediate neighbors. We have solved the LMG using the Distributed Stochastic Algorithm (DSA). This leads the agent system to a frozen configuration where agents do not change their states over time. We also present a dynamic version of the LMG and its extension to an application in sensor networks, both of which we model as a Random Boolean Network (RBN).

UR - http://www.scopus.com/inward/record.url?scp=33847240512&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33847240512&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33847240512

SN - 0769525040

SN - 9780769525044

VL - 2

SP - 341

EP - 347

BT - Proceedings - International Conference on Computational Intelligence for Modelling, Control and Automation, CIMCA 2005 and International Conference on Intelligent Agents, Web Technologies and Internet

ER -