DIMACS Workshop on Bounded Rationality
Dates: January 31 - February 1, 2005
DIMACS Center, CoRE Building, Rutgers University
- Organizers:
- Lance Fortnow, University of Chicago, fortnow@cs.uchicago.edu
- Richard McLean, Rutgers University, rpmclean@rci.rutgers.edu
- Daijiro Okada, Rutgers University, okada@econ.rutgers.edu
Presented under the auspices of the Special Focus on Computation and the Socio-Economic Sciences.
Workshop Program:
Monday, January 31, 2005
8:15 - 8:50 Breakfast and Registration - 4th Floor, Lounge, CoRE Building
8:50 - 9:00 Welcome and Opening Remarks
Fred Roberts, DIMACS Director
9:00 - 10:00 Correlation, Communication, Complexity and Competition
Abraham Neyman, Hebrew University
10:00 - 10:30 Break
10:30 - 11:30 Secret Correlation with Pure Automata
Olivier Gossner
11:30 - 12:30 Players as Serial or Parallel Random Access Machines
Timothy Van Zandt, INSEAD
12:30 - 2:00 Lunch
2:00 - 3:00 Economic and Strategic Properties of Social Networks
Michael Kearns, University of Pennsylvania
3:00 - 3:30 Break
3:30 - 4:30 Deterministic Calibration and Nash Equilibrium
Sham Kakade, University of Pennsylvania
4:30 - 5:30 For Bayesian Wannabees, Are Disagreements not About Information?
Robin Hanson, George Mason University
6:00 Dinner - DIMACS Lounge
Tuesday, February 1, 2005
8:30 - 9:00 Breakfast and Registration
9:00 - 10:00 Algorithms for Graphical Games
Luis Ortiz, MIT
10:00 - 10:30 Break
10:30 - 11:30 Deterministic Calibration with Simpler Checking Rules
Dean Foster, University of Pennsylvania
11:30 - 1:00 Lunch
1:00 - 2:00 Mechanism Design and Deliberative Agents
Kate Larson, University of Waterloo
2:00 - 2:30 Break
2:30 - 3:30 Convergence Issues in Competitive Games
Vahab Mirrokni, MIT
3:30 - 4:30 Efficient Equilibrium Algorithms for Compact Repeated Games
Michael Littman, Rutgers University
Previous: Participation
Next: Registration
Workshop Index
DIMACS Homepage
Contacting the Center
Document last modified on January 25, 2005.