An experimental study of the coloring problem on human subject networks.
Theoretical work suggests that structural properties of naturally occurring networks are important in shaping behavior and dynamics. However, the relationships between structure and behavior are difficult to establish through empirical studies, because the networks in such studies are typically fixed. We studied networks of human subjects attempting to solve the graph or network coloring problem, which models settings in which it is desirable to distinguish one's behavior from that of one's network neighbors. Networks generated by preferential attachment made solving the coloring problem more difficult than did networks based on cyclical structures, and "small worlds" networks were easier still. We also showed that providing more information can have opposite effects on performance, depending on network structure.
Kearns
Michael
M
University of Pennsylvania, Department of Computer and Information Science, 3330 Walnut Street, Philadelphia, PA 19104, USA. mkearns@cis.upenn.edu
Suri
Siddharth
S
Montfort
Nick
N
D005716:Game Theory; D006126:Group Processes; D006801:Humans; D007398:Interpersonal Relations; D012919:Social Behavior; D013598:Systems Theory