Meta

The last possible time to turn in the final project is Sunday, 15 May at 11:59pm (local time).

To submit your final each team should:

Post a final report PDF document (as a comment to this page).

Submit by email a zip file containing your bot source code and binary (following the same directions as for Project 1, but following them more closely than most teams did for Project 1!). You can also post your bot or a link to your bot on the site (but it is not required to do so).

Before Saturday, 14 May at 4:59pm each individual should send me an email with answers to the following questions:

Are you interested in continuing to work on this towards a bot to submit to the ACPC on July 1?

If so, explain what time commitment you would want to make to this (i.e., hours per week from not until July 1).

How interested are you in attending the ACPC at the AAAI 2011 conference (August 9-10 in San Francisco)?

If you want to attend it, do you have your own source of funding or would you need funds from me?

Would you be interested in presenting a poster at the poster session for the ACPC? (Note: we need to notify them of interest in this by May 15.)

Are you interested in participating in “home games” during the summer?

http://mlcomp.org/ is an interesting site that allows users to upload their data and compare how different ML algorithms do on it, or upload your algorithm and see how it does on different data sets. Not sure if anyone will find a way to use this for your poker bots, but it does seem like a very valuable service.

For tomorrow’s class, we will have updates on each team’s bot plans, and
a discussion about how to evaluate bots as you develop one. There won’t
be any prepared structure for this, but please come to class with some
ideas to discuss about this.

Hui Shu will lead Thursday’s class, and will post the topic for that class soon.

Remember that your preliminary bot submissions are due Thursday, 14 April, 11:59pm. You can submit it by posting a preliminary bot binary and PDF document describing your design and plans as a comment to this post.

Sorry this is so late. I thought I was on the 14th until Professor Evans corrected me in class.

On Tuesday we will be discussing ways to compute epsilon-equilibria for poker. We’ll review the CFR method previously discussed by Samee, then expand on the technique used in the Gilpen paper presented Thursday by Weikeng. The main focus of this class will be on convex optimization and how it can be used with Nerterov’s excessive gap technique to find epsilon-equilibria in poker. Papers to be covered include: