Workshop:
Repeated Games and Complexity

Organized by Abraham Neyman



July 13 to July 18, 1997

Stony Brook, New York

PROGRAM



  SUNDAY, JULY 13

2:30-5:00 N. Linial: Computational Complexity: An Appetizer (a mini course), Part I


  MONDAY, JULY 14

10:00-12:30 S. Sorin: Hypothesis Testing with Finite Statistics


2:30-5:00 N. Linial: Computational Complexity, Part II


  TUESDAY, JULY 15

10:00-12:30 D. Okada: Strategic Complexity and Automata


2:30-5:00 S. Sorin: Repeated Games with Bounded Complexity


  WEDNESDAY, JULY 16

10:00-12:30 A. Neyman: Finitely Repeated Games and Automata


2:30-5:00 R.E. Stearns: Applying Complexity Concepts to Strategies


  THURSDAY, JULY 17

10:00-12:30 D. Okada: Strategic Entropy and Complexity


2:30-3:00 G. Bloise: Informational Costs and Equilibrium in Repeated Games

3:15-3:45 M.R. Johnson: Algebraic Complexity of Strategy-Implementing Semiautomatons for Repeated-Play Games


  FRIDAY, JULY 18

10:00-11:00 S. Tawar (joint with M. Hartshorn): An Added Dimension to the Automated Prisoner's Dilemma: The Deterrent

11:15-11:45 V. Pasetta: Complexity and Noncommutativity in Repeated Games with Incomplete Information