On fairness in the carpool problem

We discuss the carpool problem, where one has to assign drivers to subsets of participants who commute regularly. Fagin and Williams defined a notion of fair share for participants (the FW share). We provide an axiomatic characterization of the fair share and show that the FW share is the unique one satisfying these requirements. We define a coalitional game where the Shapley value is the FW share.