{"paper":{"title":"Online purchasing under uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alan Frieze, Wesley Pegden","submitted_at":"2016-05-19T18:08:10Z","abstract_excerpt":"Suppose there is a collection $x_1,x_2,\\dots,x_N$ of independent uniform $[0,1]$ random variables, and a hypergraph $\\cF$ of \\emph{target structures} on the vertex set $\\{1,\\dots,N\\}$. We would like to buy a target structure at small cost, but we do not know all the costs $x_i$ ahead of time. Instead, we inspect the random variables $x_i$ one at a time, and after each inspection, choose to either keep the vertex $i$ at cost $x_i$, or reject vertex $i$ forever.\n  In the present paper, we consider the case where $\\{1,\\dots,N\\}$ is the edge-set of some graph, and the target structures are the spa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06072","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}