| Title | Continuous N-player Iterated Prisoners' Dilemma |
|---|---|
| Speaker | Paul Darwen, Cognitive Science Research Group, Dept of Computer Science and Electrical Engineering, University of Queensland |
| Date | Thursday, 25 Mar 1999 |
| Time | 11:10 -- 12:00 |
| Venue | Computer Science - Room 152 |
| Abstract | The iterated Prisoners' Dilemma game has received a lot of attention in the last decade or so, both as a simplified version of numerous real-world situations, and as a test problem for artificial intelligence. It elegantly covers the basics of such true life situations as recycling programs, nuclear disarmament, and world trade. The current version of interest is where there are more than 2 players, and the level of cooperation between players can vary continuously instead of only between yes-or-no values. This talk reviews recent results, and describes further work done at ADFA. |
For information on our seminar program, suggestions for seminars, or mailing list updates, please email: seminars@cs.adfa.edu.au or see: http://www.cs.adfa.edu.au/seminars/2003/