• JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
 
  Bookmark and Share
 
 
Master's Dissertation
DOI
https://doi.org/10.11606/D.3.2007.tde-31032008-161326
Document
Author
Full name
Inácio Guerberoff Lanari Bó
Institute/School/College
Knowledge Area
Date of Defense
Published
São Paulo, 2007
Supervisor
Committee
Sichman, Jaime Simão (President)
Brandão, Anarosa Alves Franco
Prado, Eleutério Fernando da Silva
Title in Portuguese
Influência da complexidade da representação de estratégias em modelos evolucionários para o dilema do prisioneiro com n jogadores.
Keywords in Portuguese
Autômatos finitos
Simulação de sistemas
Sistemas multiagentes
Teoria dos jogos
Abstract in Portuguese
Em Teoria dos Jogos, o Dilema do Prisioneiro para N Participantes (DPNP) é o problema que representa, em sua forma elementar, o paradoxo que gera as dificuldades existentes na formação da cooperação entre mais de dois agentes. Diversos trabalhos foram e continuam sendo feitos sobre esse tema, no sentido de compreender melhor os fatores que influenciam o surgimento e a evolução da cooperação numa sociedade. Neste trabalho, o objetivo principal é o de analisar o impacto do poder expressivo de um modelo de representação de estratégias neste surgimento e evolução. Para tal, foi desenvolvido um modelo computacional de jogos evolutivos, onde agentes participam repetidamente do DPNP. Nele, as estratégias que definem qual será a jogada de um determinado agente são desenvolvidas e selecionadas através de mecanismos de mutação e reprodução daquelas que obtiveram melhores resultados nas iterações anteriores, e implementadas através de duas representações com diferentes poderes computacionais: autômatos finitos e autômatos adaptativos. Este modelo foi implementado num sistema denominado S2E2 onde foram executados diversos experimentos de simulação. Através da comparação dos resultados obtidos para ambas as representações, verificou-se que em ambos os casos a sociedade consegue atingir, após um período inicial, um nível de cooperação relativamente alto e estável. A análise das estratégias utilizadas pelos agentes, entretanto, mostrou que o uso de autômatos adaptativos resulta em uma pequena vantagem, embora estatisticamente não significativa, pois permite surgir estratégias que visam retornar a uma situação de cooperação.
Title in English
Influence of strategy representation complexity in evolutionary models for the n-players Prisoner's Dilemma.
Keywords in English
Finite automata
Game theory
Multiagent systems
Systems simulation
Abstract in English
In Game Theory, the n-Players Prisoner's Dilemma (NPPD) is a problem that represents, in its elementary form, the paradox that leads to the existing difficulties in the development of cooperation between two or more agents. Many works were and are still being done about this subject, trying to better understand the factors that influence the development and evolution of cooperation in a society. In this work, the main objective is to analyze the impact of the expressive power of the strategies representation model in this development and evolution. In order to do so, a computational model of evolutionary games was developed, where agents are spatially distributed and participate on the NPPD with five participants, interacting only with their neighbors. In this model, the strategies that define the agent's decisions are developed and selected through mutation and reproduction of those strategies that obtained better results in the last iterations, and they are implemented by two representations with different computational power: finite automata and adaptative automata. This model was implemented in a system called S2E2 and several simulation experiments were carried on. Comparing the results obtained in those experiments, it was verified that after an initial period of time in both cases the society achieved a relatively high and stable level of cooperation. On the other hand, the analysis of the strategies used by the agents showed that the use of adaptative automata resulted in a slight advantage, although not statistically significative, because they allow the emergence of strategies that return to a situation of cooperation.
 
WARNING - Viewing this document is conditioned on your acceptance of the following terms of use:
This document is only for private use for research and teaching activities. Reproduction for commercial use is forbidden. This rights cover the whole data about this document as well as its contents. Any uses or copies of this document in whole or in part must include the author's name.
tese_revisada.pdf (4.50 Mbytes)
Publishing Date
2008-04-03
 
WARNING: The material described below relates to works resulting from this thesis or dissertation. The contents of these works are the author's responsibility.
  • GUERBEROFF, Inacio, QUEIROZ, Diego, and S. SICHMAN, Jaime. Studies on the effect of the expressiveness of two strategy representation languages for the iterated n-player prisoner's dilemma [doi:10.3166/ria.25.69-82]. Revue d'intelligence artificielle [online], 2011, vol. 25, n. 1, p. 69-82.
  • GUERBEROFF LANARI Bó, Inácio, and SICHMAN, Jaime Simão. An experiment on the effect of the strategy representation complexity in an evolutionary n-Players Prisoner's Dilemma model. In Brazilian Workshop on Social Simulation (BWSS), 1, Salvador, 2008.
All rights of the thesis/dissertation are from the authors
CeTI-SC/STI
Digital Library of Theses and Dissertations of USP. Copyright © 2001-2024. All rights reserved.