In the traditional setting of routing games, the standard assumption is that selfish agents are unconcerned with the performance of their competitors in the network. We propose an extension to this setting by modeling agents to consider a combination of their own performance as well as that of their rivals. Per agent, we parameterize this trade-off, thereby allowing agents to be partially selfi...