Homework: Game Theory
You may also consider generating a table. With different algorithms as columns and rows, and then statistics on how they perform against one another in the entries (e.g., do they converge? are they converging to Nash or a cooperative solution? what is the learned policy? how does convergence depend on initial conditions if relevant?)
The whole goal is to get you to explore the different possible learning algorithms and understand how they fair against themselves and one another. So this homework is a very simplified environment in which you can hopefully explore how different learning algorithms long run behavior is dependent on the decision rule and information it has available.
For example you may find that two UCB players go to cooperative solutions in PD and a UCB vs e-greedy player go to a strategy that is better for one player than another. Essentially what can happen is that players beliefs may end up getting skewed by the samples they are seeing from their competitor.
Format your homework according to the following formatting requirements:
o The answer should be typed, using Times New Roman font (size 12), double spaced, with one-inch margins on all sides.
o The response also includes a cover page containing the title of the homework, the student's name, the course title, and the date. The cover page is not included in the required page length.
o Also include a reference page. The Citations and references must follow APA format. The reference page is not included in the required page length.