{"template":"mlconf","title":"Planning for the Termination of Reciprocal Obligations","short_title":"Termination of reciprocal obligations","authors":[{"name":"Elvira S. Montalbán","affiliations":[1],"email":"e.montalban@alboran.example","corresponding":true},{"name":"Naveen K. Velanthur","affiliations":[2]},{"name":"Tereza P. Jandourková","affiliations":[1,3]}],"affiliations":["Department of Intelligent Systems, Alborán Institute of Computation, Málaga, Spain","Laboratory for Sequential Decision Systems, Cormandel School of Engineering, Puducherry, India","Centre for Formal Agency, Vltava Technical Institute, Brno, Czechia"],"abstract":"A delivery action may satisfy an outstanding obligation and create a second obligation in the opposite direction. Planners that project a task onto possession alone can therefore report success in a state with an executable return action. We study this discrepancy in the return of borrowed serving dishes. We give an obligation ledger with separately observable custody and release, and characterize a class of return rules under which every compliant sequence preserves a positive outstanding balance. We then model authorization for empty return as an observation-dependent action and solve for a finite-horizon policy over the resulting belief states. In 800 held-out initial states, a ledger-aware policy completes 692 (86.5%), compared with 620 (77.5%) for maximum-posterior replanning, a paired difference of 9.0 percentage points (95% family-bootstrap interval 5.5 to 12.6). Under compulsory refill, closure is impossible even when scheduled exchanges always succeed. A benchmark extension in which one serving dish arrives inside another exposes cases where obtaining permission to return the inner dish supplies the occasion required to renew the outer obligation.","keywords":["contingent planning","partially observable planning","obligations","terminal conditions","belief-state search"],"body":"# Introduction {#sec:intro}\n\nA recipient borrows a serving dish when accepting food brought in it. Washing the dish and returning it satisfies the owner's claim to the object. In the conventions considered here, the recipient also owes a gesture of return, usually food presented in the same dish. When that presentation counts as a gift, the original owner receives the dish and incurs the corresponding obligation. The dish is already home. The plan has another step.\n\nWe study a small family of return rules extracted as executable predicates from descriptions of reciprocal service [@orellana2019vessels; @dameri2021discharge]. The unit under study is the return convention. The rules are inputs, and a violation is a disagreement with an input rule. For the simplest convention, we prove that the number of outstanding gestures stays constant over all permitted handoffs. We use that condition to remove search branches that have lost access to release. For the stochastic part of the model, an authorization action exposes information about the other party's willingness to close. The policy has to reserve a subsequent visit for the physical return. A late authorization can arrive after the last visit it could have authorized.\n\n# Related work {#sec:related}\n\n## Representation and search\n\nThe distinction between an action precondition and a persistent fluent follows STRIPS [@fikes1971strips]. A return can have one delete effect and one add effect on the same kind of fluent. In our domain the arguments of those effects are reversed, so merging them as a net zero edit to custody discards information. For temporal control we use availability windows over discrete events. Allen's interval relations [@allen1983intervals] can express finer scheduling constraints. We use only precedence and co-occurrence, which also lets us compile most conventions into the state-dependent operators described by @ghallab2004planning. The clock-dependent release rule is explicit in that compilation. Temporal search control [@bacchus2000temporal] would be a natural way to specify prohibitions involving an entire sequence of solicitations.\n\nClassical heuristic search over a projection is inexpensive [@bonet2001heuristic], and delete-relaxation heuristics [@hoffmann2001ff] are particularly good at finding the next meeting that both parties can attend. The relaxation admits plans that keep the dish at two addresses at once and plans that still own a signed release after it has expired. Strong cyclic planning allows a fair nondeterministic loop with a possible exit [@cimatti2003cyclic]. Here the outcome of the next inquiry depends on an unchanging disposition and a changing calendar. Treating a standing refusal as a repeatable draw from a fair outcome set can certify a policy that will leave the same dish outstanding for every remaining step. @zuvela2020deferred found a related dependence when evaluating repeated requests for confirmation of whether a loan was permanent.\n\n## Planning under incomplete information\n\nOur observation kernel makes a subproblem a mixed-observability POMDP [@kaelbling1998pomdp]. The finite-horizon objective follows the backward induction of @smallwood1973optimal. We use a loss for leaving debt outstanding at the deadline and a per-step cost. An undiscounted shortest-path formulation would require care about improper policies [@bertsekas1991ssp]. Under compulsory refill there is no proper policy from a nonempty ledger. In domestic restoration tasks, earlier simulators assign an end-of-episode reward when every object is at its recorded home [@avero2021home; @leitao2023receipt]. Reversal of a debt has no effect on that reward. @sereke2022returns distinguish acknowledgment of an object from acknowledgment of an accompanying contribution. Their physical-return benchmarks record both, though they end each episode after the first admitted transfer.\n\n# Domain and observability {#sec:model}\n\n## Ledger\n\nLet $o(d)$ be the owner of dish $d$ and $p(d)$ its current possessor. The two roles are properties of the object and the execution, respectively. A directed token $u=(d,i,j)$ says that $i$ owes $j$ a gesture on account of $d$. A token never serves as authority to change the owner field. At initialization the gift has already been accepted, the receiving party holds the object, and one token exists per active dish. An unfilled transfer requires authorization for the return to the owner. Tokens stay in the ledger until consumed by a handoff. A signed permission changes what is legal at a meeting, with no immediate change to the ledger.\n\nIn the one-dish fragment a filled handoff consumes $(d,i,j)$ and adds $(d,j,i)$. The new debtor also takes custody. For the purposes of this fragment an item is filled if the receiver counts its contents as a gift, even if no new food was prepared. Reclassifying a gift after the exchange is outside the domain. A permitted unfilled handoff consumes the token and leaves $p(d)=j$. If $j$ is a borrower the operator also places the object in the owner's custody, within the same meeting, when the owner is present and the contract permits direct return. The planner can solicit permission for that three-party handoff. For a single pair, a release that would deliver an object away from its owner is unavailable. For a two-person return this restriction blocks release after an odd number of filled handoffs.\n\nLet $\\mathcal{D}$ be the set of dishes and $U_t$ the outstanding tokens after transition $t$. The end test given to the evaluator is\n\n$$\nG_t=\\mathbf{1}\\{U_t=\\varnothing\\}\n  \\prod_{d\\in\\mathcal{D}}\\mathbf{1}\\{p_t(d)=o(d)\\}.\n\\label{eq:goal}\n$$\n\n## Invariant under refill\n\nLet $r(a)$ count tokens consumed by executed action $a$ and $g(a)$ count tokens created. We count creation events even when the new token has the same arguments as a previously resolved token. By construction,\n\n$$\n|U_{t+1}|-|U_t|=g(a_t)-r(a_t).\n\\label{eq:balance}\n$$\n\n::: proposition {#prop:return title=\"Closed refill rules\"}\nSuppose $|U_0|>0$ and each available action that consumes a token creates at least as many tokens. Then no finite execution achieves @eq:goal.\n:::\n\n::: proof\nFor transitions that consume a token, the hypothesis gives $g(a)\\ge r(a)$. For all others $r(a)=0$ and $g(a)\\ge 0$. Summing @eq:balance gives $|U_t|\\ge |U_0|$ at every finite $t$. Apply @eq:goal.\n:::\n\nWhen meetings remain available, one filled handoff restores custody in the two-person, one-dish case. Another restores the initial ledger and replaces the dish at the borrower’s address. On a repeating calendar even the augmented state repeats if the next available meeting is indexed modulo the calendar period. In the lifted representation the two most recent gifts have different event identifiers. Those identifiers may be ignored for reachability. They may not be ignored for costing, since the policy pays for each gift regardless of which direction it went.\n\n## Requests and release\n\nThe domain has two request channels. A private inquiry produces either an indication of willingness or an indication of refusal. It grants no action permission. A formal request can produce a signed ticket for the next valid visit or a refusal. The ticket identifies the dish, its final owner, its current possessor and the visit slot. A signed ticket satisfies the release precondition only for the named exchange. The planner can leave it unused. It cannot be spent early on a different visit or used twice. The rule compiler rejects tickets for visits with incompatible custody requirements, even when the named people are all free.\n\nEach pair has a latent disposition $z$ sampled once, with three classes. An unconditional class accepts formal requests for a feasible return slot. A calendar-dependent class accepts them when the occasion meets the active rule's predicate. A continuing class declines. These are deterministic conditions on the formal action and latent state. The private inquiry is noisy conditional on $z$ and the occasion family. At the default prototype it returns a positive sign with probabilities 0.85, 0.60 and 0.15, respectively. Rule templates draw perturbations of at most 0.05 per row. A group extending the private reply without extending the validity of its tickets changes two rows of the observation kernel and no row of the transition kernel. We ablate the private channel in @sec:ablation.\n\nTime is public. A wait action advances to the next calendar slot, and every other action advances by one slot after it is processed. Speaking slots and transfer slots can overlap. Because each step holds one action, asking for a release during a transfer slot forfeits the transfer at that slot. Each feasible successor is computed after expiring all permission records dated earlier than the new time. Expiration is independent of whether the planner has a later return scheduled.\n\n# Planning {#sec:planner}\n\nWrite $s$ for the public state, including the ledger and the remaining calendar, and $b(z)$ for the posterior over dispositions. The formal response is observable. Given response $y$ to action $a$, the update is\n\n$$\nb^{a,y}(z)=\n\\frac{b(z)P(y\\mid s,a,z)}\n{\\sum_{z'}b(z')P(y\\mid s,a,z')}.\n\\label{eq:posterior}\n$$\n\nWe use the exact posterior at the current public state as the key, with the remaining horizon, in a memoized dynamic program. All probabilities are rational and are stored as reduced integers during planning. We choose a cost of 1 per executed action, an additional cost of 2 per filled transfer, and a terminal cost of 32 for an open case. The first two costs describe event counts, with a premium for producing a gift. A demand to minimize gifts alone admits a policy that waits until time runs out. Under the stated costs a policy is allowed to stop early and take the penalty if the reachable closure probability is too low. Illegal actions are masked in the ledger-aware variants.\n\nIf $c(a)$ is one-step cost and $s^{a,y}$ the public successor, the full search uses\n\n$$\nV_h(s,b)=\\min\\left\\{32,\\ \\min_a\n\\left[c(a)+\\sum_y P(y\\mid s,a,b)V_{h-1}(s^{a,y},b^{a,y})\\right]\\right\\}.\n\\label{eq:bellman}\n$$\n\nTerminal goals have value zero for every horizon, and $V_0(s,b)=32$ for other states. Actions restricted by a valid ticket are generated before @eq:posterior is called. The sum includes all observable outcomes of actions with nonzero probability. In @alg:solve the certificate check first ignores all private replies and sets each formal reply optimistically to acceptance wherever some element of posterior support permits it. It searches this finite relaxed graph for a goal within the remaining time. For the closed refill fragment @prop:return proves the same result without building the graph. The relaxed test can underestimate the cost of successful closure. It cannot remove a state from which a legal closure is reachable within the horizon.\n\n```algorithm {#alg:solve caption=\"Finite-horizon search with an optimistic closure test\"}\nRequire: public state $s$, disposition posterior $b$, remaining slots $h$\nif $G(s)=1$ then\n    return $0$\nend if\nif $h=0$ or RelaxedClosure$(s,\\operatorname{supp}(b),h)$ fails then\n    return $32$\nend if\n$v \\gets 32$\nfor each admissible action $a$ at $s$ do\n    $q \\gets c(a)$\n    for each response $y$ with positive predictive probability do\n        $q \\gets q+P(y\\mid s,a,b)V_{h-1}(s^{a,y},b^{a,y})$\n    end for\n    $v \\gets \\min(v,q)$\nend for\nreturn $v$\n```\n\n# Evaluation design {#sec:design}\n\n## Instance construction\n\nWe generated 600 independent rule families. A family fixes a rule graph, availability mask, observation-noise range and ownership pattern. Four start cases per family vary the initial slot and draw latent dispositions from the family's prior. Cases in a family share their rule graph and public time grid. We assigned 300 families to development, 100 to validation and 200 to the test set before generating the four cases. The test set has 50 families of each of four kinds. A rule family's salted identifier fixes its split, and a separate stream keyed by the instance identifier drives observation outcomes. We fixed tie breaks, cost weights and the 12-slot horizon before the test runs. @sec:app describes the split and the random streams. Test-time priors are provided to every belief-based policy. Outcome draws for a given action, state and visit are coupled across policies; alternate visits receive their own draws. The random seed never enters a policy state.\n\nThe four case kinds appear in @tbl:cases. In the ordinary case, a pair with one dish has periodic meetings that can support release. In the calendar case, the release is tied to one marked visit in a shorter window. The pair may receive two independently owed dishes in the nested case. The outer dish can contain the inner dish during transfer, and custody records refer to each dish separately. A formal request for the inner return may name a visit that satisfies the calendar predicate for a pending outer gift. That visit also turns on the corresponding refill operator, even for a party that could previously perform only an empty transfer at that address. In the inherited case some admissible signatures bind a previous owner's availability pattern and some bind the active owner. Present ownership is always public. Inheritance is a stored rule on a particular dish, not something inferred from a family name.\n\nTable: Test starts and valid closures under ledger-aware search. Each row contains 50 distinct rule families. {#tbl:cases}\n\n| Rule family | Dishes | Starts | Closures | Rate (%) |\n|:------------|-------:|-------:|---------:|---------:|\n| Ordinary | 1 | 200 | 190 | 95.0 |\n| Calendar | 1 | 200 | 183 | 91.5 |\n| Nested | 2 | 200 | 172 | 86.0 |\n| Inherited | 1 | 200 | 147 | 73.5 |\n| All | | 800 | 692 | 86.5 |\n\n## Comparators and inference\n\nInventory A* uses a cost of one per step with an admissible lower bound given by the number of needed deliveries divided by the maximum dishes delivered at a visit. It commits to an empty return because the added gift premium makes a filled handoff strictly more expensive for the same delivered custody. Refill only excludes all release actions and executes the earliest permitted filled return when custody is wrong. If custody has been restored it stops. Myopic release scores each request by its predicted acceptance and the earliest compatible delivery. If no request can secure a ticket for an upcoming visit, it falls back to the next feasible filled return that restores custody. MAP replanning solves the deterministic problem for the posterior mode at each step and masks returns for which it lacks an actual signed ticket. The disposition oracle uses the same cost and exact search after receiving $z$. It still needs a signed ticket. Informing the oracle about existing permissions alone would add no information, since all policies can read their own records.\n\nThe primary estimand is the test-family mean paired difference in valid closure probability between full search and MAP replanning. A valid closure occurs when all actions pass replay and the first $G_t=1$ occurs by slot 12. Early stops with open debt, and planned actions rejected by replay, count as failures. We report percentile intervals from 10,000 bootstrap replicates of families within each case kind [@efron1993bootstrap]. Within each replicate we keep the two policies paired on each start. Resampling individuals would split cases that share their availability masks. Comparisons beyond the primary contrast are descriptive. The terminal-cost ablation reuses the same event streams.\n\n# Results {#sec:results}\n\n## Completion and possession\n\nThe inventory-only plan returns all objects in 782 cases in its projected simulator, which accepts physically feasible handoffs without reading the ledger. In the full domain those 782 plans attempt an unlicensed transfer, and the other 18 never find a delivery slot. The refill policy has lower physical recovery and zero closure. @tbl:main gives counts, and @fig:split displays the gap on the proportion scale. The three release policies and the oracle have identical admissibility masks. Their differences reflect which visits and outcomes they make reachable. The oracle has the highest observed completion and should be read as a comparator supplied with privileged information, not a pointwise upper bound on success. It minimizes expected cost under @eq:bellman, which allows early stopping.\n\nTable: Outcomes by planner at horizon 12. Closure requires a legal trace. Inventory custody is measured in the custody-only simulator. {#tbl:main span=full}\n\n| Planner | Custody restored | Valid closures | Closure (%) | Open or invalid |\n|:--------|-----------------:|---------------:|------------:|----------------:|\n| Inventory A* | 782 | 0 | 0.0 | 800 |\n| Refill only | 761 | 0 | 0.0 | 800 |\n| Myopic release | 671 | 600 | 75.0 | 200 |\n| MAP replanning | 693 | 620 | 77.5 | 180 |\n| Full search | 734 | 692 | 86.5 | 108 |\n| Disposition oracle | 755 | 724 | 90.5 | 76 |\n\n![Physical restoration and valid closure by policy. The inventory policy's restoration count uses its projected simulator.](disposition-outcomes){#fig:split width=0.76}\n\nThe paired difference against MAP replanning is 9.0 points (95% interval 5.5 to 12.6). Full search finds a productive solicitation in some cases where the modal type is continuing. The same solicitation can be worth the slot when the posterior puts its remaining mass on a calendar-dependent type and the only qualifying visit is two slots away. Conversely, for a pair whose unconditional class is modal only until the first private inquiry, a plan that spends the speaking slot on a formal request can leave too little time to act on the refusal it obtains. The main difference in the logs is the placement of the first formal request. In a paired audit of the 72 net additional closures, there were 103 cases closed by full search alone and 31 closed by MAP alone. Several of the latter had a substantially lower posterior closure probability than typical cases at initialization. The cost criterion permits declining such a case even when its sampled disposition would have allowed closure.\n\n## When the projected plan ends\n\n@fig:clock gives cumulative completion under the fixed 12-slot policy, rather than results from solving a different instance at each horizon. At slot four, 286 valid closures have occurred. The inventory policy has restored 708 projected inventories by that slot. A success metric triggered by the last reduction in physical distance would therefore put the inventory planner well ahead early in the episode. The gap peaks at 422 cases at slot four on this grid.\n\n```chart {#fig:clock width=0.76 caption=\"Cumulative closures in the fixed twelve-slot runs. Inventory A* is credited in the upper series when all objects reach their owners in its projection.\"}\n{\"type\":\"line\",\"xlabel\":\"Elapsed slots\",\"ylabel\":\"Completed starts (count)\",\"x\":[2,4,6,8,10,12],\"series\":[{\"label\":\"Inventory, custody only\",\"y\":[336,708,746,767,776,782],\"style\":\"dashed\",\"marker\":\"s\"},{\"label\":\"Full search, valid closure\",\"y\":[40,286,438,534,630,692],\"marker\":\"o\"},{\"label\":\"MAP, valid closure\",\"y\":[32,253,402,495,568,620],\"marker\":\"^\"}],\"legend\":\"lower right\",\"ylim\":[0,800]}\n```\n\nWe traced the 108 failures of full search to the first event that made closure impossible or to a voluntary halt while closure still had positive probability. The resulting categories are mutually exclusive. A refusal that revealed the continuing type accounted for 47, expiration of the last feasible visit for 39, and a positive-cost voluntary halt for 22. The first two categories use the latent-state replay when assigning cause. In the third category the halt precedes the deadline, and an alternative allowed policy would have a positive probability of closing from the public state. An oracle cannot necessarily change the first category. It can change some calendar expirations by asking for the appropriate recipient's signature before the other party has responded.\n\n@fig:failure shows the classification by case kind. The inherited failure rate includes both continuing-type cases and brittle calendars that no longer agree with current possession. In 16 of the 53 inherited failures the last possible slot was an occasion attached to the past owner. Six of those slots had already elapsed before the dish was actually returned to the active owner with a gift. At that point the new obligation was attached to a valid owner and an appointment that could only occur in the past.\n\n```chart {#fig:failure width=0.76 caption=\"First classified failure per open execution under full search. Rows sum to the failures implied by the denominators in the case table.\"}\n{\"type\":\"heatmap\",\"rows\":[\"Ordinary\",\"Calendar\",\"Nested\",\"Inherited\"],\"cols\":[\"Refusal\",\"Last visit\",\"Halt\"],\"values\":[[6,2,2],[8,5,4],[11,11,6],[22,21,10]],\"colormap\":\"Blues\",\"annotate\":true,\"fmt\":\".0f\",\"colorbar\":\"Starts (count)\"}\n```\n\n## Policy ablations {#sec:ablation}\n\nRemoving the private channel costs 26 closures. Raising the terminal cost to 64 recovers ten at the expense of increasing the mean executed actions per start from 6.1 to 6.7. The search pursues favorable replies with low prior probability when the cost of stopping rises. A third ablation lets a ticket name two successive visit slots while still requiring all relevant parties to accept it. Only the nested family has a second physically feasible visit. @tbl:ablation includes this result as a change to the legal execution set.\n\nTable: Policy and rule sensitivity at the same initial states. The extended ticket changes the valid execution set. {#tbl:ablation}\n\n| Setting | Closures | Difference |\n|:--------|---------:|-----------:|\n| Full search | 692 | 0 |\n| No private channel | 666 | −26 |\n| Terminal cost 64 | 702 | +10 |\n| Extended nested ticket | 705 | +13 |\n\n# Nested transfers and accumulated precedent {#sec:extension}\n\nA plate can travel on a tray. The physical movement of the plate then requires custody of both items, even if the tray remains an independent loan. @benarroch2024stacked reports that borrowers sometimes present the small container already sitting inside the larger one when the recipient agreed to receive only the small container. We introduce a variant with an explicit support constraint. An inner dish may be handed over by itself when it has been removed beforehand. Removal occupies a slot. A gift on the tray counts against the tray's own token. An outer token is therefore resolvable with an unfilled handoff only if the tray reaches its owner without a departure gift, including a filled inner dish resting on it.\n\nWe instrumented 60 separately generated nested instances with a side rule for acknowledgments [@fraser2022acknowledgment]. The recipient at the designated release visit can sign a receipt and send it back in a small envelope. A receipt in the recipient's hand creates nothing. A receipt presented on the outer tray counts as a contribution under the active outer rule. We varied that routing bit while holding the signature, container state and visit constant. A valid policy closed 49 of 60 starts when the receipt was handed over separately and 32 of 60 when it traveled on the tray. On replay, 18 starts closed only under separate routing and one only under tray routing. The exceptional case with tray routing uses a new outer token to schedule a visit the original release did not make available. The class is small enough that we report counts without using it in the primary inference.\n\nThe episode that motivated this extension began with a cake plate placed on a borrowed tray. The designated return visit accepted the empty tray. The acknowledgment for receiving it was handed back on the now-empty tray. From the viewpoint of the acknowledgment rule the recipient had just received a signed document as a presented object and owed a gesture. The owner lent out the tray again to carry the acknowledgment home. By @eq:balance the two-document variant cannot terminate if each acknowledgment subsequently travels on an object whose rule treats it as a contribution. The physical size of the acknowledgment is absent from the proof. Printing it smaller helps only on instances whose support rule admits a different carrier.\n\n# Scope and conclusion {#sec:discussion}\n\nThe generator takes return conventions as fixed for an episode. A recipient can decline a release, but cannot stop counting deliveries halfway through unless the template admits that transition. The fractions above quantify solver performance under those inputs. No prevalence estimate for any disposition follows from them. Established relations may also share a release across multiple objects. The two-dish model with one ticket per dish has no such global release. Adding the operator would require a joint authorization state when the people who own the dishes differ. @matsuzaki2023authority describes that case for organized lending, where a local custodian signs for a collection under a shared rule.\n\n\\appendix\n\n# Generator and implementation {#sec:app}\n\nEach rule family has one of four topology codes, its sequence of 12 availability masks and a latent-type prior tabulated in twentieths. The generator draws at least two feasible visit masks per actor before applying the template restrictions. A latent draw uses integers from a counter-based stream; observation thresholds use hundredths and the same stream with a separately keyed counter. Calendar masks for development and validation can have the same Hamming weight as test masks. They cannot have the same generator template identifier. Split assignment is stratified by topology. We canonicalize actor labels before generating test ids to keep relabelings of a single case together. Multiple starts per family are retained when their realized dispositions or starting times coincide. There is no case-wise deduplication after the split.\n\n# Search cost and reproducibility {#sec:compute}\n\nWe checked the relaxed certificate by disabling it on the validation set and comparing the selected action and value at every start. Search tables are process-local and discarded between starts. At the main horizon the median end-to-end full-search time per case was 8.4 ms, and the 95th percentile was 62 ms, on one 3.2 GHz x86-64 CPU core. These timings include the reachability precheck and exclude replay. Search evaluates up to five action schemas per slot in the core generator, with grounded arguments generating additional branches in two-dish cases. Peak resident memory for a single sequential test sweep was 74 MB. The inner receipt extension runs independently with the same state representation and a routing bit in the operator input. No learned model or accelerator is used.","bibliography":"@article{fikes1971strips, author={Fikes, Richard E. and Nilsson, Nils J.}, title={{STRIPS}: A New Approach to the Application of Theorem Proving to Problem Solving}, journal={Artificial Intelligence}, volume={2}, number={3--4}, pages={189--208}, year={1971}}\n@article{allen1983intervals, author={Allen, James F.}, title={Maintaining Knowledge about Temporal Intervals}, journal={Communications of the ACM}, volume={26}, number={11}, pages={832--843}, year={1983}}\n@book{ghallab2004planning, author={Ghallab, Malik and Nau, Dana and Traverso, Paolo}, title={Automated Planning: Theory and Practice}, publisher={Morgan Kaufmann}, year={2004}}\n@article{bacchus2000temporal, author={Bacchus, Fahiem and Kabanza, Froduald}, title={Using Temporal Logics to Express Search Control Knowledge for Planning}, journal={Artificial Intelligence}, volume={116}, number={1--2}, pages={123--191}, year={2000}}\n@article{bonet2001heuristic, author={Bonet, Blai and Geffner, Hector}, title={Planning as Heuristic Search}, journal={Artificial Intelligence}, volume={129}, number={1--2}, pages={5--33}, year={2001}}\n@article{hoffmann2001ff, author={Hoffmann, Jörg and Nebel, Bernhard}, title={The {FF} Planning System: Fast Plan Generation Through Heuristic Search}, journal={Journal of Artificial Intelligence Research}, volume={14}, pages={253--302}, year={2001}}\n@article{cimatti2003cyclic, author={Cimatti, Alessandro and Pistore, Marco and Roveri, Marco and Traverso, Paolo}, title={Weak, Strong, and Strong Cyclic Planning via Symbolic Model Checking}, journal={Artificial Intelligence}, volume={147}, number={1--2}, pages={35--84}, year={2003}}\n@article{kaelbling1998pomdp, author={Kaelbling, Leslie Pack and Littman, Michael L. and Cassandra, Anthony R.}, title={Planning and Acting in Partially Observable Stochastic Domains}, journal={Artificial Intelligence}, volume={101}, number={1--2}, pages={99--134}, year={1998}}\n@article{smallwood1973optimal, author={Smallwood, Richard D. and Sondik, Edward J.}, title={The Optimal Control of Partially Observable Markov Processes over a Finite Horizon}, journal={Operations Research}, volume={21}, number={5}, pages={1071--1088}, year={1973}}\n@article{bertsekas1991ssp, author={Bertsekas, Dimitri P. and Tsitsiklis, John N.}, title={An Analysis of Stochastic Shortest Path Problems}, journal={Mathematics of Operations Research}, volume={16}, number={3}, pages={580--595}, year={1991}}\n@book{efron1993bootstrap, author={Efron, Bradley and Tibshirani, Robert J.}, title={An Introduction to the Bootstrap}, publisher={Chapman and Hall}, year={1993}}\n@article{orellana2019vessels, author={Orellana Sieder, Beatriz and Hult, Mirja R.}, title={Vessels in Circulation: Property Retention in Small-Scale Food Exchange}, journal={Review of Material Exchange}, volume={12}, pages={21--48}, year={2019}}\n@article{dameri2021discharge, author={Dameri, Giuliano T. and Audenot, Aline}, title={Discharge Conditions in Reciprocal Service}, journal={Studies in Economic Practice}, volume={19}, number={2}, pages={114--139}, year={2021}}\n@inproceedings{zuvela2020deferred, author={Žuvela, Daria M. and Vind, Asger R.}, title={Deferred Decisions in Household Lending Protocols}, booktitle={Workshop on Temporal Agency}, pages={38--46}, year={2020}}\n@inproceedings{avero2021home, author={Avero, Cristóbal M. and Diko, Mellanie}, title={Home Positions as Terminal Predicates in Domestic Task Planning}, booktitle={Workshop on Computational Models of Domestic Activity}, pages={51--59}, year={2021}}\n@article{leitao2023receipt, author={Leitão, Marta V. and Bregger, Ole H.}, title={Receipt and Restoration in Episodic Object Exchange}, journal={Journal of Situated Planning}, volume={8}, pages={206--231}, year={2023}}\n@inproceedings{sereke2022returns, author={Sereke, Luwam and Nolet, Céline R.}, title={Returns with Compound Acknowledgment}, booktitle={Workshop on Representing Social Action}, pages={84--92}, year={2022}}\n@article{benarroch2024stacked, author={Benarroch, Marina E. and Kvasný, Samuel}, title={Stacked Containers and the Scope of Return Permission}, journal={Review of Material Exchange}, volume={17}, pages={177--201}, year={2024}}\n@article{fraser2022acknowledgment, author={Fraser, Moira G. and Caras, Doina V.}, title={Document Transfer as a Credited Contribution}, journal={Journal of Transactional Practice}, volume={11}, number={3}, pages={248--269}, year={2022}}\n@article{matsuzaki2023authority, author={Matsuzaki, Rento and Bile, Mariette F.}, title={Delegated Authority in Collective Equipment Lending}, journal={Studies in Economic Practice}, volume={21}, pages={53--77}, year={2023}}","figures":[{"id":"disposition-outcomes","kind":"chart","data":"{\"type\":\"bar\",\"xlabel\":\"Policy\",\"ylabel\":\"Share of starts (%)\",\"x\":[\"Inventory\",\"Refill\",\"Myopic\",\"MAP\",\"Full\",\"Oracle\"],\"series\":[{\"label\":\"Custody restored\",\"y\":[97.75,95.125,83.875,86.625,91.75,94.375]},{\"label\":\"Valid closure\",\"y\":[0,0,75,77.5,86.5,90.5]}],\"ylim\":[0,105],\"legend\":\"outside\"}"}],"acknowledgments":"We thank Flóra Eszenyi for independently implementing the transfer replay and Márcio D. Calvetti for identifying the support constraint in the two-dish generator.","options":{"citation_style":"author-year"}}