|COMPUTER SCIENCE/DISCRETE MATH, III|
|Affiliation:||University of California, Berkeley|
|Date:||Wednesday, June 1|
|Time/Room:||11:15am - 12:15pm/S-101|
There has been some recent excitement and progress in the long-stalled topic of efficient algorithms for finding equilibria in games and other economic contexts. We discuss some of these developments.