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.

Additional Metadata
Keywords AI-based Resource Management, Commons game, Intelligent game playing, Resolving N-person games
Persistent URL dx.doi.org/10.1007/978-3-642-13059-5_45
Series Lecture Notes in Computer Science
Citation
Verkhogliad, P. (Petro), & Oommen, J. (2010). Potential AI strategies to solve the Commons Game: A position paper. In Lecture Notes in Computer Science. doi:10.1007/978-3-642-13059-5_45