Back to results
Monterey, CA; Naval Postgraduate School
TOURNAMENT-WINNING STRATEGY FOR ITERATED OPTIONAL PRISONER'S DILEMMA
Abstract
dc:description.abstractIterated optional prisoner's dilemma (IOPD) is an adversarial game that can be used to model several real-world scenarios, from mutual grooming between primates to alliances between business firms. This study utilizes simulation techniques to determine winning strategies for IOPD tournaments in a variety of initial conditions. Machine learning techniques are used to iteratively improve upon the winning strategy, culminating in a single undefeated strategy. The outcome of this study is a single strategy that we claim is likely to win an IOPD tournament for most reasonable initial conditions.
Degree
thesis:*- Department dc:contributor.department
- Computer Science (CS)
- Grantor dc:publisher
- Monterey, CA; Naval Postgraduate School
- Year dc:date.issued
- 2000
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Shamma, Ahmed A.
- Advisor dc:contributor.advisor
-
- Kroll, Joshua A.
Rights
dc:rights- Statement dc:rights
-
- This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- https://hdl.handle.net/10945/66137
- OAI identifier oai:identifier
- oai:calhoun.nps.edu:10945/66137