Learn more about the research we're doing at Volunteer Science.
In the traveling salesman problem, the subject is presented with the scenario of a salesman who has to go to a number of identified cities, and the objective is to produce an itinerary that takes the salesman through every city and returns them to the origin that minimizes the total distance traveled. A solution is simply a sequence of cities traveled to that includes each city a single time. This research has participants solve these problems in several collaborative configurations. We expect that performance will be best when players have some information about other players' performance but that too much information will overload them and lead to worse performance.