Beaufils, B., Delahaye, J.-P., and Mathieu, P., "Our meeting with gradual: A good strategy for the iterated prisoner's dilemma", Proceedings Artificial Life V, Nara, Japan, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Performance Self-Assessment by and for Regulation in Autonomous.. - Tzafestas (Correct)
....(TFT, in short) Start by cooperating, From there on return the opponent s previous move. This behavior has achieved the highest scores in early tournaments and has been found to be fairly stable in ecological settings. The best designed behavior found so far in the literature is GRADUAL [13] which manages to achieve the highest scores against virtually all other designed behaviors. This behavior starts by cooperating and then plays Tit For Tat, except that it does not defect just once to an opponent s defection. Instead, it responds by playing blindly (nxD)CC, where n is the ....
....grim, gradual, etc. Behaviors that are essentially cooperative and retaliating, but start suspiciously by playing a few times D in the beginning, so as to probe their opponent s behavior and decide on what they have to do next. For example, suspicious tft (STFT) and the prober behavior of [13]. Behaviors that are clearly irrational, because they don t use any feedback from the game. For example, the random behavior and all blind periodic behaviors such as CCD, DDC etc. A behavior will maximize its score, if it is able to converge to cooperation with all behaviors of the first two ....
Beaufils, B., Delahaye, J.-P., and Mathieu, P., "Our meeting with gradual: A good strategy for the iterated prisoner's dilemma", Proceedings Artificial Life V, Nara, Japan, 1996.
Toward Adaptive Cooperative Behavior - Tzafestas (2000) (Correct)
.... may also find studies in an evolutionary perspective (Fogel 1993) theoretical or applied biological studies (Axelrod Dion 1988, Feldman Thomas 1987, Milinski 1987) and studies of modified IPD versions (Stanley et al. 1994) The best designed behavior found so far in the literature is GRADUAL (Beaufils et al. 1996) which manages to achieve the highest scores against virtually all other designed behaviors. This behavior starts by cooperating and then plays Tit For Tat, except that it does not defect just once to an opponent s defection. Instead, it responds by playing blindly (nxD)CC, where n is the ....
....increasingly long, etc. Behaviors that are essentially cooperative and retaliating, but start suspiciously by playing a few times D in the beginning, so as to probe their opponent s behavior and decide on what they have to do next (for example, suspicious tft (STFT) and the prober behavior of Beaufils et al. 1996) Behaviors that are clearly irrational, because they don t use any feedback from the game (for example, the random behavior and all blind periodic behaviors such as CCD, DDC etc. A behavior will maximize its score, if it is able to converge to cooperation with all behaviors of the first two ....
[Article contains additional citation context not shown here]
Beaufils, B., Delahaye, J.-P., and Mathieu, P. (1996) Our meeting with gradual: A good strategy for the iterated prisoner's dilemma. Proceedings of the Artificial Life V Conference, Nara, Japan.
A Game-Theoretic Solution of Conflicts Among.. - Yoshida, Inuzuka.. (Correct)
....intended compromise and advantage take intended compromise and advantage damage by collision Table 2. Compromise Dilemma game b a give take give U=2 U=2 I=2 A=3 take A=3 I=2 C=1 C=1 Table 3. Payoff matrix of Compromise Dilemma (CD) game have been proposed and discussed in the literature [1, 3]. Indeed, there are many different cases of dilemmas by different assignments of the values of T , R, P and S in the payoff matrix (in the sense of relative difference of the values or different orders of values) The condition that T , R, P and S take different values has been used in previous ....
Bruno Beaufils, Jean-Paul Delahaye and Phillippe Mathieu: "Our Meeting With Gradual: A Good Strategy For The Iterated Prisoner's Dilemma", Artificial Life V (Proceedings of the Fifth Int'l Workshop on the Synthesis and Simulation of Living Systems), pp.202--209, MIT Press, 1997.
Random Strategies in a Two Levels Iterated Prisoner's.. - Delahaye, Mathieu (1996) (1 citation) Self-citation (Delahaye Mathieu) (Correct)
....experiment shows that the improvement added to REASON to obtain REASON TIT FOR TATleads to a strategy which now beats DEFECT. Score list after tournament 1 reason tft 50 = 4997 2 defect = 2007 0 20 40 60 80 100 120 140 160 180 200 2 3 reason tft 50 defect 4. 3 TIT FOR TAT against REASON Once again [4] TIT FOR TAT reputation have to be reconsidered. In the Lift Dilemma, deterministic strategies cannot be good, and this the case for TIT FOR TAT. Nevertheless it is able to favour metacooperation with a period of two rounds. In fact it plays well against REASON (average of 4 points) unfortunately ....
B. Beaufils, J.P. Delahaye, and P. Mathieu, `Our meeting with gradual, a good strategy for the iterated prisoner's dilemma', in Artificial Life, Proc. 5th International Workshop on the Synthesis and Simulation of Living Systems, ed., C. Langton, volume 5, (1996). Artificial Life 5, Nara, Japan, May 16-18.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC