Rotation and Time-Sharing Rule¶
Scheduling rule — instantiates Preference Conflict Accommodation
Gives everyone the same indivisible good in turns across time — a schedule, sequence, and handoff — when simultaneous sharing is impossible but taking turns is fair.
Some goods cannot be split and cannot be duplicated, but they can be taken in turns. A single cabin, a chairmanship, an on-call pager, a prime parking spot — only one party can hold it at a time, yet over a year everyone can have a fair share. Rotation and Time-Sharing Rule is the mechanism that converts a rivalrous, indivisible claim into a temporal accommodation: it fixes a sequence, a duration per turn, a priority for scarce slots, and a clean handoff, so the same good passes among the claimants on a schedule everyone accepted in advance. Its defining move is that it distributes one thing across time rather than distributing different things across people — nobody gets a lesser version; everyone gets the same good, later or sooner. It works only when the claimants' preferences are symmetric enough that waiting one's turn is genuinely fair, and it fails badly when a turn's value is wildly unequal across periods or when the loss of not having it now is irreversible.
Example¶
Three siblings inherit a lakeside cabin. All three want it, especially over the six warm summer weeks; none will sell, and the cabin obviously cannot be occupied by all three families at once without ruining the point. A rotation rule turns the fight into a calendar. The compatibility work comes first: the summer weeks are the rivalrous, high-demand resource (that is the real conflict), while the shoulder seasons are abundant enough that anyone who wants them can have them — so only the peak weeks need rationing.
The rule assigns the six peak weeks in a rotating priority order that shifts each year: whoever had the coveted July 4th week this year drops to last pick next year, so no sibling permanently owns the best slot. Each turn comes with a duration (two peak weeks per family) and a handoff protocol — the cabin is left clean, the propane refilled, a shared logbook updated — so one family's turn does not degrade the next's. A light monitor tracks dissatisfaction: if one sibling's work schedule makes summer turns useless year after year, that asymmetry is a signal the plain rotation is not actually fair to them, triggering a swap or a side arrangement. The logic is the same as a rotating savings and credit association, where members take the whole pot in turn on a fixed rotation because the sequence, over time, treats everyone equally.[n1]
How it works¶
- Map what is truly rivalrous. Separate the genuinely scarce, indivisible periods from abundant ones; rotate only what must be rationed.
- Fix the sequence and shift it. Set a rotation order and rotate the priority itself over cycles, so no claimant permanently holds the best slot.
- Set turn duration and slot priority. Define how long each turn lasts and how competing claims to the same scarce slot are ordered.
- Specify the handoff. Require a defined condition-on-return (clean, restocked, logged) so one turn does not erode the next.
- Monitor for asymmetric value. Track whether a claimant's turns are systematically worth less, and trigger swaps or compensation when the "fair" rotation is not actually fair to them.
Tuning parameters¶
- Turn length — how long each holder keeps the good. Longer turns cut handoff overhead but make waiting more painful; shorter turns share more evenly but churn.
- Priority-shift rule — how the pick order rotates across cycles (strict reverse, random re-seed, seniority-decay). Rotating priority prevents lock-in but adds bookkeeping.
- Slot granularity — whether the good is diced into many small periods or a few large ones. Fine granularity smooths fairness; coarse granularity preserves usable blocks.
- Swap flexibility — how freely holders may trade turns. Free swaps absorb schedule shocks but can let a wealthier party buy the best slots, quietly eroding equal turns.
- Handoff strictness — how tightly return condition is enforced. Strict handoffs protect later holders but raise friction and disputes.
When it helps, and when it misleads¶
Its strength is that it delivers equal treatment over time without anyone accepting a degraded good: everyone eventually holds the same thing, and rotating the priority itself blocks the permanent capture of the best slots. It is cheap, legible, and self-evidently fair when the periods are interchangeable.[n1]
Its failure mode is asymmetric time value: rotation assumes a turn is worth roughly the same to everyone, but if one claimant can only use the good in a period they never get, or if not having it now causes irreversible harm (the sick relative who needed the cabin this summer), the schedule's surface fairness masks a real inequity. The classic misuse is rotating a good whose value is spiky and non-substitutable — a rotating "turn" at a one-time opportunity that cannot wait. The guarding discipline is to rotate only symmetric, repeatable goods, and to monitor for holders whose turns are systematically worthless so the rule can swap, compensate, or exit them rather than pretend the calendar is fair.
How it implements the components¶
bargaining_trade_compensation_and_rotation_path— the rotation-and-time-sharing schedule is the rotation branch of this path, distributing an indivisible good in fair turns.conflict_and_compatibility_structure— separating the rivalrous peak periods from abundant ones is exactly the compatibility mapping that decides what must be rationed at all.implementation_commitment_and_dissatisfaction_monitor— the handoff protocol and the asymmetric-value monitor turn the schedule into an enforced, watched commitment.
It does not offer parallel differentiated versions with a protected base floor (accommodation_option_portfolio — that is Segmented Version or Local Option, its nearest twin: segmentation lets different actors simultaneously hold different versions, whereas rotation gives every actor the very same indivisible good in turn).
Related¶
- Instantiates: Preference Conflict Accommodation — the rotation/time-sharing path, used when an indivisible good can be shared over time but not at once.
- Sibling mechanisms: Segmented Version or Local Option · Two-Sided or Multi-Sided Matching · Interest-Based Bargaining Protocol · Compensation and Burden-Sharing Pact · Controlled Random Tie-Break · Mediation, Deadlock, and Escalation Ladder · Preference Elicitation and Tradeoff Matrix · Ranked or Approval Choice with Audit · Deliberative Weighting Workshop
Editorial Notes¶
Form Classification¶
Form family: Rule, Policy & Commitment
Rationale: Rotation and Time-Sharing Rule operates as a standing rule, threshold, contractual commitment, or policy constraint governing future conduct because it gives everyone the same indivisible good in turns across time — a schedule, sequence, and handoff — when simultaneous sharing is impossible but taking turns is fair.
Independent corroboration: The frozen evidence defines Rotation and Time-Sharing Rule as 'Gives everyone the same indivisible good in turns across time — a schedule, sequence, and handoff — when simultaneous sharing is impossible but taking turns is fair', so its operative form is Rule, Policy & Commitment.
Nearest alternative: Protocol, Workflow & Routine — Rotation and Time-Sharing Rule includes features of a repeatable ordered procedure or handoff sequence that coordinates action, but its defining operation is a standing rule, threshold, contractual commitment, or policy constraint governing future conduct.
Review outcome: Independent reviewer agreement; medium confidence.
Origin Attribution¶
Primary origin: Philosophy
Origin pattern: Convergent development
Present-day reach: Universal
Rationale: Equal turns over time solve a normative fair-allocation problem when an indivisible resource cannot be shared simultaneously, placing distributive philosophy closest to the mechanism’s justification. Economics, law, scheduling theory, and management independently supply allocation procedures and enforceable handoffs.
Related originating lineages:
- Economics & Finance — economics_finance contributes cost, allocation, repeated-game, expectation, and risk-analysis traditions to the mechanism’s formative or independently convergent form; that contribution does not displace the primary philosophy lineage.
- Law & Governance — law_governance contributes rights, duties, authorization, tenure limits, and accountable procedure to the mechanism’s formative or independently convergent form; that contribution does not displace the primary philosophy lineage.
- Operations Research — operations_research contributes scheduling, queueing, optimization, scenario analysis, and capacity control to the mechanism’s formative or independently convergent form; that contribution does not displace the primary philosophy lineage.
- Organizational & Management Science — organizational_management contributes decision records, operating routines, knowledge reuse, and institutional learning to the mechanism’s formative or independently convergent form; that contribution does not displace the primary philosophy lineage.
Review resolution: The blind reviewers disagreed on primary lineage (philosophy versus law_governance); authoritative or primary research supports philosophy as the best historical origin. Equal turns over time solve a normative fair-allocation problem when an indivisible resource cannot be shared simultaneously, placing distributive philosophy closest to the mechanism’s justification. Economics, law, scheduling theory, and management independently supply allocation procedures and enforceable handoffs. The cited Stanford Encyclopedia of Philosophy, Formal Approaches to Social Procedures; Cambridge Handbook of Computational Social Choice, Cake Cutting Algorithms directly supports the defining operation used in that choice. All independently supported contributing domains are retained without an arbitrary cap, while domain_reach=universal records later applicability separately from provenance.
Attribution caveat: Turn-taking is ancient and independently reinvented; philosophy is selected for the fairness criterion, not as a claim that philosophers invented every rotating schedule.
Encyclopedia synthesis: The exact catalogued form synthesizes established practice rather than reproducing a single standard historical label.
Review outcome: Researched adjudication after independent review; medium confidence.
Sources consulted:
- Stanford Encyclopedia of Philosophy, Formal Approaches to Social Procedures
- Cambridge Handbook of Computational Social Choice, Cake Cutting Algorithms
Notes¶
[n1] A rotating savings and credit association (ROSCA) — a group whose members contribute to a common pot and take the whole pot in turns on a fixed rotation. It is the clearest real-world proof that a rotation over time can be strictly fair to symmetric participants, and its weakness — members near the end of the rotation bear more risk — mirrors this mechanism's asymmetric-time-value failure mode. ↩a ↩b