Abstract
Based on a simple actor model, I derive theory concerning satisfied networks of close, reciprocal friendships. By satisfied networks I mean networks of actors who would be unhappier with more or fewer close friends. Deductions concern characteristics of such networks, such as that a satisfied network component (connected subnetwork) containing an actor with only one friend must be a dyad. I show that the model of satisfied friendship networks fits eight empirical friendship networks significantly better than a random model. Finally, I show the theory's usefulness by making five additional predictions, including two involving intervention.