Vis enkel innførsel

dc.contributor.authorVerkhogliad, Petro
dc.contributor.authorOommen, B. John
dc.date.accessioned2010-11-17T13:25:27Z
dc.date.available2010-11-17T13:25:27Z
dc.date.issued2010
dc.identifier.citationVerkhogliad, P. & Oommen, B. J. (2010). Potential AI Strategies to Solve the Commons Game : A Position Paper. In A. Farzindar, A. & Kešelj, V. (Eds.), Advances in Artificial Intelligence. Lecture Notes in Computer Science, 6085, 352-356. Springer.en_US
dc.identifier.isbn978-3-642-13059-5
dc.identifier.issn1611-3349
dc.identifier.urihttp://hdl.handle.net/11250/137805
dc.description.abstractIn 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.en_US
dc.language.isoengen_US
dc.publisherSpringeren_US
dc.relation.ispartofseriesLecture Notes in Computer Science; no. 6085
dc.titlePotential AI Strategies to Solve the Commons Game : A Position Paperen_US
dc.typeJournal articleen_US
dc.typePeer reviewed
dc.rights.holder© 2010 Springer
dc.source.pagenumber352-356
dc.source.volume6085
dc.source.journalLecture Notes in Computer Science
dc.identifier.doihttp://dx.doi.org/10.1007/978-3-642-13059-5_45


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel