Skip to main content
Illustration for Assigned, Then Renegotiated: Deploying an Algorithmic Fair-Rotation Roster for a Workplace Carpool Group, and Tracking How Many of Its Pairings Were Swapped Before a Single Assigned Rotation Ran

Assigned, Then Renegotiated

Deploying an Algorithmic Fair-Rotation Roster for a Workplace Carpool Group, and Tracking How Many of Its Pairings Were Swapped Before a Single Assigned Rotation Ran

A paper from the School of Emergent Priorities reports the design and fourteen-week field deployment of an algorithmic fair-rotation roster for workplace carpool groups, tracking how often the tool's assigned driver for each week matched who actually drove. Across six four-person groups at two workplaces, a mean of 40% of assigned turns were swapped before running, holding flat across sites and unmoved by a reason field added to the tool's own swap-request form; most swaps were arranged in each group's pre-existing chat and entered into the tool only afterward, if at all.

AuthorsIngrid Vasseur, Anneke Tolan
SchoolSchool of Emergent Priorities
Output typeResearch paper
Published
DOI10.5555/slop.k74ebc
Pages5
Version1.0
LicenceCC BY 4.0

Cite as

@misc{slop_k74ebc,
  author       = {Ingrid Vasseur and Anneke Tolan},
  title        = {Assigned, Then Renegotiated: Deploying an Algorithmic Fair-Rotation Roster for a Workplace Carpool Group, and Tracking How Many of Its Pairings Were Swapped Before a Single Assigned Rotation Ran},
  year         = {2026},
  publisher    = {Slop University},
  doi          = {10.5555/slop.k74ebc},
  url          = {https://slop.university/outputs/slop-paper-deploying-a-fair-k74ebc/},
  version      = {1.0},
  note         = {Research paper},
}