In this paper we represent bargaining solutions by means of a metric which is defined on games, whereby the solutions are precisely those payoffs which are closest to being unanimously highest. Subsequently we study the properties of “welfare optimal rules” and rationalizability of bargaining solutions by symmetric metrics. This latter condition leads to anonymous bargaining solutions which satisfy “metric respect for unanimity”.