The University of Southampton
University of Southampton Institutional Repository

Finding robust Texas Hold’em poker strategies using Pareto coevolution and deterministic crowding

Finding robust Texas Hold’em poker strategies using Pareto coevolution and deterministic crowding
Finding robust Texas Hold’em poker strategies using Pareto coevolution and deterministic crowding
233-239
CSREA Press
Noble, J.
440f07ba-dbb8-4d66-b969-36cde4e3b764
Wani, M. A.
Noble, J.
440f07ba-dbb8-4d66-b969-36cde4e3b764
Wani, M. A.

Noble, J. (2002) Finding robust Texas Hold’em poker strategies using Pareto coevolution and deterministic crowding. Wani, M. A. (ed.) In Proceedings of the 2002 International Conference on Machine Learning and Applications (ICMLA’02). CSREA Press. pp. 233-239 .

Record type: Conference or Workshop Item (Paper)
Text
icmla.pdf - Other
Download (197kB)

More information

Published date: 2002
Organisations: Agents, Interactions & Complexity

Identifiers

Local EPrints ID: 265253
URI: http://eprints.soton.ac.uk/id/eprint/265253
PURE UUID: 22f2c2ce-b35e-4749-971e-e0a40fde607e

Catalogue record

Date deposited: 03 Mar 2008 23:28
Last modified: 14 Mar 2024 08:05

Export record

Contributors

Author: J. Noble
Editor: M. A. Wani

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×