Sciweavers

AAAI
2006
14 years 2 months ago
Maintaining Cooperation in Noisy Environments
To prevent or alleviate conflicts in multi-agent environments, it is important to distinguish between situations where another agent has misbehaved intentionally and situations wh...
Tsz-Chiu Au, Dana S. Nau
ATAL
2008
Springer
14 years 2 months ago
Social reward shaping in the prisoner's dilemma
Reward shaping is a well-known technique applied to help reinforcement-learning agents converge more quickly to nearoptimal behavior. In this paper, we introduce social reward sha...
Monica Babes, Enrique Munoz de Cote, Michael L. Li...
ECAI
2006
Springer
14 years 4 months ago
Cheating Is Not Playing: Methodological Issues of Computational Game Theory
Abstract. Computational Game Theory is a way to study and evaluate behaviors using game theory models, via agent-based computer simulations. One of the most known example of this a...
Bruno Beaufils, Philippe Mathieu
ATAL
2006
Springer
14 years 4 months ago
Learning to cooperate in multi-agent social dilemmas
In many Multi-Agent Systems (MAS), agents (even if selfinterested) need to cooperate in order to maximize their own utilities. Most of the multi-agent learning algorithms focus on...
Jose Enrique Munoz de Cote, Alessandro Lazaric, Ma...
ATAL
2006
Springer
14 years 4 months ago
Accident or intention: that is the question (in the Noisy Iterated Prisoner's Dilemma)
This paper focuses on the Noisy Iterated Prisoner's Dilemma, a version of the Iterated Prisoner's Dilemma (IPD) in which there is a nonzero probability that a "coop...
Tsz-Chiu Au, Dana S. Nau
ACSC
2004
IEEE
14 years 4 months ago
On Evolving Fixed Pattern Strategies for Iterated Prisoner's Dilemma
Table 1 shows the payoff to player one. The same matrix also holds for player two. Player one can gain the maximum 5 points (T = 5) by defection if player two cooperates. However,...
Daniel Jang, Peter A. Whigham, Grant Dick
EPS
1998
Springer
14 years 4 months ago
Complete Classes of Strategies for the Classical Iterated Prisoner's Dilemma
The Classical Iterated Prisoner's Dilemma (CIPD) is used to study the evolution of cooperation. We show, with a genetic approach, how basic ideas could be used in order to gen...
Bruno Beaufils, Jean-Paul Delahaye, Philippe Mathi...
EPS
1998
Springer
14 years 4 months ago
Acquisition of General Adaptive Features by Evolution
We investigate the following question. Do populations of evolving agents adapt only to their recent environment or do general adaptive features appear over time? We find statistica...
Dan Ashlock, John E. Mayfield
GECCO
2005
Springer
135views Optimization» more  GECCO 2005»
14 years 6 months ago
The impact of cellular representation on finite state agents for prisoner's dilemma
The iterated prisoner’s dilemma is a widely used computational model of cooperation and conflict. Many studies report emergent cooperation in populations of agents trained to p...
Daniel A. Ashlock, Eun-Youn Kim
ATAL
2005
Springer
14 years 6 months ago
A framework for decomposing reputation in MAS into competence and integrity
In multi-agent communities, trust is required when agents hold different beliefs or conflicting goals. We present a framework for decomposing agent reputation into competence—...
Michael J. Smith, Marie desJardins