A fair carpool scheduling algorithm

Authors:
Ronald Fagin;John H. Williams
Affiliations:
IBM Research Division, San Jose, California;IBM Research Division, San Jose, California
Venue:
IBM Journal of Research and Development
Year:
1983

Citing 0
Cited 4

Capturing Fair Computations on Concurrent Constraint Language

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Managing QoS through prioritization in web services

WISEW'03 Proceedings of the Fourth international conference on Web information systems engineering workshops
Classification of ride-sharing partners based on multiple constraints

Journal of Computing Sciences in Colleges
The optimality of the online greedy algorithm in carpool and chairman assignment problems

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a simple carpool scheduling algorithm in which no penalty is assessed to a carpool member who does not ride on any given day. The algorithm is shown to be fair, in a certain reasonable sense. The amount of bookkeeping grows only linearly with the number of carpool members.