From Santa Fe Institute Events Wiki

Revision as of 17:19, 10 January 2011 by Liz (talk | contribs) (Created page with '{{Graduate Workshop in Computational Social Science Modeling and Complexity}} ==Program Announcement== Program Announcement 2010 ==Students==…')
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Workshop Navigation

Program Announcement

Program Announcement 2010


  • Randy Casstevens, Computational Social Science, George Mason University (
  • Vessela Daskalova, Economics, U. of London (
  • Ozge Kalkan Dilaver, Economics and Management Science, Lancaster University (
  • David Hendry, Political Science, U. of Illinois Urbana-Champaign (
  • Coco Krumme, Media Lab, MIT (
  • Davide Marchiori, Economics and Management, U. of Trento (
  • Miriam Rehm, Economics, New School for Social Research (
  • Jennifer Trueblood, Cognitive Science, Indiana U. (
  • Olivia Woolley, Engineering and Applied Mathematics, Northwestern University (
  • Matt Zimmerman, Ecology, U. of California Davis (


Schedule 2010



Homework Problem 2010

Student Projects

Each student began a research project during the two-week workshop. Below are brief descriptions of these various projects. These projects will form the basis for dissertation chapters and/or journal articles.

Randy Casstevens, Computational Social Science, George Mason University (
Randy is exploring the process of innovation in software development. He compares patterns of human-problem solving, as measured by a public MATLAB Programming Contest, and those that arise via evolutionary computation. The MATLAB contest explored programs that could solve a non-trivial peg solitaire game, and it had over 3000 submissions from over 100 programmers. The evolutionary computation problem was the Artificial Ant Problem from the genetic programming community. Both systems display punctuated equilibria in terms of overall performance metrics, had new efforts exploiting recently introduced innovations, and have some interesting similarities concerning measures of program complexity. One important parameter linked to the growth of program complexity is the amount of parsimony pressure applied to the evolving programs.