Algorithms for solving two-player normal form games. Tuomas Sandholm Carnegie Mellon University Computer Science Department. Recall: Nash equilibrium. Let A and B be | M | x | N | matrices. Mixed strategies: Probability distributions over M and N
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Carnegie Mellon University
Computer Science Department
Example of label definitions
Run of the algorithm
Ryan Porter, Eugene Nudelman & Yoav Shoham
[AAAI-04, extended version in GEB]
(Checks whether there is a NE with given supports)
Solvable by LP
Tuomas Sandholm, Andrew Gilpin, Vincent Conitzer
[AAAI-05 & more recent results]
These results are from a newer,
extended version of the paper.