On fairness in the carpool problem

Authors:
Moni Naor
Affiliations:
Department of Computer Science and Applied Math., Weizmann Institute of Science, Rehovot 76100, Israel
Venue:
Journal of Algorithms
Year:
2005

Citing 1
Cited 3

Fairness in scheduling

Journal of Algorithms - Special issue on SODA '95 papers

Easy and hard coalition resource game formation problems: a parameterized complexity analysis

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Solving coalitional resource games

Artificial Intelligence
Planning and optimising organisational travel plans using an evolutionary algorithm

EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.