Online purchasing under uncertainty
Alan Frieze, Wesley Pegden

TL;DR
This paper studies an online decision-making problem where one must select specific graph structures like spanning trees or matchings from randomly revealed costs, aiming to minimize total cost without prior knowledge.
Contribution
It introduces a framework for online purchasing of complex graph structures under uncertainty, extending previous models to include various target structures such as spanning trees and Hamilton cycles.
Findings
Develops algorithms for online selection of graph structures
Analyzes cost bounds for different target structures
Provides theoretical guarantees for online strategies
Abstract
Suppose there is a collection of independent uniform random variables, and a hypergraph of \emph{target structures} on the vertex set . We would like to buy a target structure at small cost, but we do not know all the costs ahead of time. Instead, we inspect the random variables one at a time, and after each inspection, choose to either keep the vertex at cost , or reject vertex forever. In the present paper, we consider the case where is the edge-set of some graph, and the target structures are the spanning trees of a graph, spanning arborescences of a digraph, the paths between a fixed pair of vertices, perfect matchings, Hamilton cycles or the cliques of some fixed size.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
