Potential AI strategies to solve the Commons Game: A position paper

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we propose the use of hill climbing and particle swarm optimization to find strategies in order to play the Commons Game (CG). The game, which is a non-trivial N-person non-zero-sum game, presents a simple mechanism to formulate how different parties can use shared resources. If the parties cooperate, the resources are sustainable. However, the resources get depleted if used indiscriminately. We consider the case when a single player has to determine the "optimal" solution, and when the other N∈-∈1 players play the game by choosing the options with a fixed probability vector. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Verkhogliad, P., & Oommen, B. J. (2010). Potential AI strategies to solve the Commons Game: A position paper. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6085 LNAI, pp. 352–356). https://doi.org/10.1007/978-3-642-13059-5_45

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