Coordinating Team Players within a Noisy Iterated Prisoner’s Dilemma Tournament
Coordinating Team Players within a Noisy Iterated Prisoner’s Dilemma Tournament
In this paper, we present our investigation into the use of a team of players within a noisy Iterated Prisoner’s Dilemma (IPD) tournament. We show that the members of such a team are able to use a pre-arranged sequence of moves that they make at the start of each interaction in order to recognise one another, and that by coordinating their actions they can increase the chances that one of the team members wins the round-robin style tournament. We consider, in detail, the factors that influence the performance of this team and we show that the problem that the team members face, when they attempt to recognise one another within the noisy IPD tournament, is exactly analogous to the problem, studied in information theory, of communicating reliably over a noisy channel. Thus we demonstrate that we can use error correcting codes to implement this recognition, and by doing so, further optimise the performance of the team.
243-259
Rogers, Alex
f9130bc6-da32-474e-9fab-6c6cb8077fdc
Dash, Rajdeep K.
589f704a-00dd-4921-b4f4-e47362cc552f
Ramchurn, Sarvapali D.
1d62ae2a-a498-444e-912d-a6082d3aaea3
Vytelingum, Perukrishnen
51f06fc5-024c-450d-bff2-e19c943aa87e
Jennings, N. R.
ab3d94cc-247c-4545-9d1e-65873d6cdb30
May 2007
Rogers, Alex
f9130bc6-da32-474e-9fab-6c6cb8077fdc
Dash, Rajdeep K.
589f704a-00dd-4921-b4f4-e47362cc552f
Ramchurn, Sarvapali D.
1d62ae2a-a498-444e-912d-a6082d3aaea3
Vytelingum, Perukrishnen
51f06fc5-024c-450d-bff2-e19c943aa87e
Jennings, N. R.
ab3d94cc-247c-4545-9d1e-65873d6cdb30
Rogers, Alex, Dash, Rajdeep K., Ramchurn, Sarvapali D., Vytelingum, Perukrishnen and Jennings, N. R.
(2007)
Coordinating Team Players within a Noisy Iterated Prisoner’s Dilemma Tournament.
Theoretical Computer Science, 377 (1-3), .
Abstract
In this paper, we present our investigation into the use of a team of players within a noisy Iterated Prisoner’s Dilemma (IPD) tournament. We show that the members of such a team are able to use a pre-arranged sequence of moves that they make at the start of each interaction in order to recognise one another, and that by coordinating their actions they can increase the chances that one of the team members wins the round-robin style tournament. We consider, in detail, the factors that influence the performance of this team and we show that the problem that the team members face, when they attempt to recognise one another within the noisy IPD tournament, is exactly analogous to the problem, studied in information theory, of communicating reliably over a noisy channel. Thus we demonstrate that we can use error correcting codes to implement this recognition, and by doing so, further optimise the performance of the team.
Text
journal_paper.pdf
- Other
More information
Published date: May 2007
Organisations:
Agents, Interactions & Complexity
Identifiers
Local EPrints ID: 263238
URI: http://eprints.soton.ac.uk/id/eprint/263238
ISSN: 0304-3975
PURE UUID: 77deb476-b007-4f3f-b664-be94067908a9
Catalogue record
Date deposited: 19 Dec 2006
Last modified: 15 Mar 2024 03:22
Export record
Contributors
Author:
Alex Rogers
Author:
Rajdeep K. Dash
Author:
Sarvapali D. Ramchurn
Author:
Perukrishnen Vytelingum
Author:
N. R. Jennings
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics