120 likes | 217 Views
Explore a model analyzing the dilemmas of repeated prisoner interactions. Understand inputs, strategies, and future choices to maximize profit. Utilize Python software for simulation and strategic decision-making. Discover how cooperation can still arise even in unfavorable scenarios.
E N D
Un modelo sobre el dilema del prisionero iterado (A model about the iterated prisoners' dilemma) Victoria Gradín Alfonso Pérez Más vale bueno por conocer(Better good later)
Model overview • Inputs • Payments matrix • History • Parameters • History Memory Opponent + Payments Future Choice • Outputs • Strategies
Constrains • Choice Future Opponent+Payments Memory • Choice: Maximum profit • Future: Decision tree • Opponent: Statistical distributions • Memory: Counters
Memory • Count: Add 1 • sum(n) = • sum(n+1) =
Opponent • Beta distribution: • Beta(1,1) = Uniform • Dispersion gets lower as information grows • In the long run, Beta's mean value approaches the frequency
Future • Bifurcations • Tree of possible futures
Choice • Calculate cooperation profits, and defection profits • Chose the option that maximizes profits
Current state • Software: Python implementation • Verification of some reasonable properties (adaptive, non-exploitable) against fixed strategies (alld, allc, cooperative-tft) • Parameter estimation for one kind of behavior
Cooperation in matrix V • Why cooperate in the less favorable case?
Preliminary conclusions • Sometimes, it's better good to know • Cooperation is possible, even under adverse circumstances, with selfish behaviour (no need for altruism).