Cited by 73Transportation and Mobility InnovationsTransportation Planning and OptimizationGame Theory and Voting Systems

A fair carpool scheduling algorithm

Fagin, Ronald, Williams, John H.·1983·IBM Journal of Research and Development

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.

Integrity signals

Registry

Crossref · 10.1147/rd.272.0133

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The carpooling problem was first proposed and studied in Fagin and Williams (1983) and later studied in Ajtai et al. (1998).

    “From the point of view of algorithm, the carpooling problem was first proposed and studied in Fagin and Williams (1983) and later studied in Ajtai et al. (1998).”

    From PoliUniPool: a carpooling system for universities (2011) · cites this paper as Fagin and Williams (1983)

  • Ajtai et al. (1998) and Fagin and Williams (1983) mostly deal with online schemes, where the schedule of future arrivals of participants is not known.

    “Ajtai et al. (1998) and Fagin and Williams (1983), for the most part, deal with online schemes, i.e. when the schedule of future arrivals of participants is not known.”

    From PoliUniPool: a carpooling system for universities (2011) · cites this paper as Fagin and Williams (1983)

Cites

Still being checked.

Cited by

Sorted by citations

Authors
Fagin, R., & Williams, J. H.
Affiliations
IBM (United States) (US)
Venue
IBM Journal of Research and Development
Publisher
IBM
Published
1983-03
Volume
27
Issue
2
Pages
133-139
ISSN
0018-8646 (ISSN-L)
OpenAlex
W2063709997
Cited by
73
References
0
Citations by year
2025: 2 · 2024: 3 · 2023: 3 · 2022: 2 · 2021: 2 · 2020: 2 · 2019: 2 · 2018: 4 · 2017: 7 · 2016: 5 · 2015: 5 · 2014: 7 · 2013: 3 · 2012: 3
FWCI
1.86
Type
journal article
Language
en
Open access
closed
Locations
IBM Journal of Research and Development (publishedVersion)
Topics
  • Physical Sciences › Engineering › Automotive Engineering › Transportation and Mobility Innovations
  • Social Sciences › Transportation › Transportation Planning and Optimization
  • Social Sciences › Economics, Econometrics and Finance › Economics and Econometrics › Game Theory and Voting Systems
Keywords
fair scheduling, ride-sharing, scheduling algorithms, fairness

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review