Costly Information Combinatorial Selection (CICS)

• CICS is a framework that models decision problems involving stochastic items whose values are revealed through costly MDP-based inspections.
• The approach reduces the problem to a free-information benchmark via commitment policies, enabling approximation guarantees under constraints like matroids and knapsacks.
• Applications include advanced Pandora’s Box problems and diverse combinatorial settings, with improved bounds on commitment gaps and approximation ratios.

Searching arXiv for the primary paper and closely related CICS work. Search query: (Chawla et al., 27 Aug 2025) Commitment Gap via Correlation Gap Costly Information Combinatorial Selection (CICS) is a general framework for decision problems where one must choose a feasible subset of stochastic items, but learning each item’s value requires going through a costly information-acquisition process. In the formulation emphasized by recent work, each item is associated with a Markov Decision Process (MDP), and the global objective is either to maximize the total value of the selection minus the cost of information acquisition or to minimize the cost of the solution plus the cost of information acquisition. The framework generalizes Weitzman’s Pandora’s Box problem, Pandora’s Box with Optional Inspection, Pandora’s Box with Partial Inspection, and broader combinatorial constraints including matroids, knapsack, and $k$-systems (Chawla et al., 27 Aug 2025, Chawla et al., 2024).

1. Formal model

A standard maximization formulation begins with a ground set $[n] := \{1,\dots,n\}$ and a downward-closed feasibility family $F \subseteq 2^{[n]}$. Examples explicitly studied include single selection, matroid constraints, knapsack constraints, $k$-systems, and general downward-closed packing constraints. Each element $i$ has an unknown realized value, and information about that value can only be obtained by interacting with a finite MDP $M_i$ whose states encode progressively refined information about the item (Chawla et al., 27 Aug 2025).

For item $i$, the MDP $M_i$ is specified by states $\Omega_i$, a designated root state $\sigma_i$, terminal states $[n] := \{1,\dots,n\}$0, actions $[n] := \{1,\dots,n\}$1 at each state $[n] := \{1,\dots,n\}$2, action costs $[n] := \{1,\dots,n\}$3, and transition probabilities $[n] := \{1,\dots,n\}$4. Terminal states $[n] := \{1,\dots,n\}$5 have known values $[n] := \{1,\dots,n\}$6. The MDPs are assumed to be DAGs, so random walks terminate almost surely. Acting in the MDP corresponds to paying for information, such as partial observations, tests, or additional inspection, until one reaches a terminal state that reveals a value (Chawla et al., 27 Aug 2025).

A policy maintains the global state

$[n] := \{1,\dots,n\}$7

initially $[n] := \{1,\dots,n\}$8 for all $[n] := \{1,\dots,n\}$9. At each step it either probes, by choosing an unfinished MDP $F \subseteq 2^{[n]}$0 and an action $F \subseteq 2^{[n]}$1, paying $F \subseteq 2^{[n]}$2 and transitioning according to $F \subseteq 2^{[n]}$3, or stops and selects a feasible subset

$F \subseteq 2^{[n]}$4

If $F \subseteq 2^{[n]}$5 denotes total probing cost and $F \subseteq 2^{[n]}$6 denotes the total value of accepted terminal states, the utility of a policy $F \subseteq 2^{[n]}$7 is

$F \subseteq 2^{[n]}$8

and the optimal value is

$F \subseteq 2^{[n]}$9

A broader min/max version of CICS distinguishes between upward-closed feasibility for minimization and downward-closed feasibility for maximization. In that formulation, min-CICS stops when the accepted set becomes feasible and minimizes expected solution cost plus information cost, while max-CICS maintains feasibility throughout and maximizes expected value minus information cost. This broader model is also described as a bandit superprocess over component MDPs (Chawla et al., 2024).

2. Policy classes, computational difficulty, and the commitment gap

The general optimal policy in CICS may be highly adaptive: it can decide which MDP to explore next, which action to take inside that MDP, and when to stop, all as a function of the entire history. Because the joint state space is exponentially large, determining the optimal algorithm is known to be a computationally challenging problem. This motivates a central restriction: committing policies (Chawla et al., 27 Aug 2025).

A commitment $k$0 fixes, for each item $k$1 and each local state $k$2, a distribution over actions,

$k$3

A policy commits to $k$4 if, whenever it probes item $k$5 in state $k$6, the chosen action is sampled from $k$7. Once local commitments are fixed, each $k$8 collapses into a Markov chain $k$9 whose transition probabilities and costs are averaged under $i$0. Thus any committing policy for the original instance is equivalent to a policy on an MC-CICS instance $i$1 (Chawla et al., 27 Aug 2025).

The loss induced by this restriction is measured by the commitment gap: $i$2 The numerator is the value of the best fully adaptive policy, and the denominator is the value of the best committing policy. Bounding this ratio from above shows that committing policies are near-optimal. In the maximization setting, the paper “Commitment Gap via Correlation Gap” develops improved bounds on this quantity by reducing CICS to a free-information benchmark (Chawla et al., 27 Aug 2025).

The same paper also records a sharp limitation. For the minimization version of CICS, the commitment gap can be unbounded even under single-selection constraints. This rules out a symmetric commitment-gap theory for minimization and indicates that the positive commitment-gap results are inherently tied to the maximization version (Chawla et al., 27 Aug 2025).

3. Reduction to free-information selection and structural benchmarks

The key reduction in the current theory passes from CICS to Bayesian Combinatorial Selection (BCS), where values are sampled from a product distribution and information is free. For a BCS instance with feasibility constraint $i$3 and product distribution $i$4, the ex post and ex ante benchmarks are

$i$5

and

$i$6

where $i$7 is the polytope relaxation and $i$8 is the expected value of $i$9 conditioned on lying in the top $M_i$0 quantile of $M_i$1 (Chawla et al., 27 Aug 2025).

For MC-CICS, costs are absorbed into surrogate terminal values. Each terminal state $M_i$2 receives a surrogate $M_i$3, inducing a random variable $M_i$4, and the index of a state is

$M_i$5

A key amortization lemma states that for a policy $M_i$6,

$M_i$7

with equality under a natural promise-of-payment condition. This makes the utility of a costly-information policy comparable to the value of selecting surrogate random variables in a free-information problem (Chawla et al., 27 Aug 2025).

The reduction is then sharpened through semi-online and free-order BCS algorithms. In the semi-online model, items may be revisited and only binary threshold feedback is observed; in the free-order online model, items may be probed in any order and their exact values are observed, but acceptance or rejection is irrevocable. The paper proves that, relative to the ex ante benchmark, the best achievable ratio is the same in both models: $M_i$8 This identification is the paper’s “Semi-online vs free-order” theorem and is the formal bridge from CICS to ex ante free-order prophet inequalities (Chawla et al., 27 Aug 2025).

A second structural ingredient is the correlation gap

$M_i$9

which, by Yan’s identity quoted in the paper, equals

$i$0

Combining these ideas yields the central corollary

$i$1

so any upper bound on ex ante free-order prophet inequalities for the feasibility family $i$2 immediately gives an upper bound on the commitment gap for CICS (Chawla et al., 27 Aug 2025).

4. Approximation guarantees and representative special cases

The structural reduction translates directly into explicit constants. Let $i$3 denote the best known upper bound on the ex ante free-order prophet inequality factor of $i$4. Then for any CICS instance $i$5,

$i$6

and, for any $i$7, one can compute a committing policy $i$8 such that

$i$9

in time polynomial in the instance size and $M_i$0 (Chawla et al., 27 Aug 2025).

Feasibility constraint	Bound $M_i$1	Consequence
Matroid constraints	$M_i$2	Efficient committing-policy approximation
$M_i$3-system constraints	$M_i$4	Commitment-gap bound
Knapsack constraints	$M_i$5	Commitment-gap bound

For matroids, the $M_i$6 bound improves earlier efficient guarantees. In particular, for Pandora’s Box with Optional Inspection under matroid constraints, it improves the best known efficient approximation ratio from about $M_i$7 to about $M_i$8, while matching the earlier existential commitment-gap bound of Beyhaghi–Kleinberg (Chawla et al., 27 Aug 2025).

A parallel line of work studies local approximation for individual MDPs and composes those local guarantees into global CICS algorithms. In the framework of “Combinatorial Selection with Costly Information,” the central objects are surrogate costs or values $M_i$9, local $\Omega_i$0-approximation, pointwise approximation, and, for maximization PBOI, semilocal $\Omega_i$1-approximation. The general composition theorem states that if each component MDP admits an $\Omega_i$2-local approximation, then combining the committed chains via a water-filling index policy or an appropriate frugal algorithm yields a global $\Omega_i$3-approximation for matroid CICS, and an $\Omega_i$4-type guarantee for broader frugal combinatorial structures (Chawla et al., 2024).

This framework yields several explicit special-case guarantees. For minimization PBPI under matroid constraints, there is an efficient $\Omega_i$5-approximation obtained by committing each box either to open or to peek according to a closed-form inequality involving $\Omega_i$6, $\Omega_i$7, and the peeking index $\Omega_i$8. For the Weighing Scale problem under matroid constraints, an “One-Sided Halving” committing policy gives an $\Omega_i$9-approximation, where

$\sigma_i$0

For matroid max-PBOI, pure local approximation cannot beat $\sigma_i$1, but semilocal approximation yields an efficient $\sigma_i$2-approximation via randomized hedging between grabbing and opening (Chawla et al., 2024).

5. Antecedents, adjacent formulations, and related research programs

CICS is part of a broader line of work on combinatorial optimization with costly information. Earlier “price of information” models studied stochastic costs or rewards on combinatorial objects, semiadditive objectives, and probing prices $\sigma_i$3. In that framework, utility maximization takes the form

$\sigma_i$4

while disutility minimization takes the form

$\sigma_i$5

A central technique is the construction of grades and surrogate variables, such as

$\sigma_i$6

and the transfer of frugal algorithms from a free-information world to the price-of-information world (Singla, 2017). This suggests a direct conceptual antecedent for the surrogate-value reductions used in later CICS work.

Several neighboring literatures instantiate costly-information combinatorial selection in domain-specific forms. “Data-Driven Online Decision Making with Costly Information Acquisition” studies Sim-OOS and Seq-OOS, where a learner chooses simultaneous or sequential costly observations before acting, and proves sublinear regret (Atan et al., 2016). “The Diverse Cohort Selection Problem” models applicants as arms with weak and strong pulls and develops the SWAP algorithm for combinatorial pure exploration with heterogeneous information cost (Schumann et al., 2017). “Seeding with Costly Network Information” studies influence maximization when network structure must be learned through influence samples or edge probes, and develops INF-SAMPLE, PROBE, and SEED under explicit information budgets (Eckles et al., 2019).

A broader interpretation also includes costly source selection in Bayesian hypothesis testing, where MCIS and MPIS optimize subsets of information sources under misclassification penalties and submodularity or weak submodularity assumptions (Bhargav et al., 2024); sorting and selection with random comparison costs, where the information units are pairwise comparisons and the goal is to buy a certificate for order statistics or full sorting (0710.0083); and lifelong learning in costly feature spaces, where shared metafeatures reduce feature evaluations across tasks (Balcan et al., 2017). These models are not identical to the MDP-based CICS formalism, but they reinforce the same central theme: combinatorial decisions are coupled to explicit costs for revealing the information needed to make them.

6. Conceptual implications, misconceptions, and open directions

One common misconception is to identify CICS with one-step “open-or-not” inspection models. The formalism is strictly richer: each item can require a series of costly steps, modeled by an MDP, and global feasibility can be a matroid, knapsack, $\sigma_i$7-system, or a more general frugal combinatorial structure (Chawla et al., 27 Aug 2025, Chawla et al., 2024). Another misconception is that semi-online selection is intrinsically stronger than free-order online selection in the ex ante regime. The current theory shows that, although semi-online can strictly outperform free-order relative to ex post benchmarks, this separation disappears relative to the ex ante benchmark (Chawla et al., 27 Aug 2025).

A second conceptual consequence is an adaptivity hierarchy. Fully adaptive CICS policies can be compared to committing policies; committing policies can be reduced to MC-CICS; MC-CICS can be represented through surrogate-value BCS; and semi-online and free-order prophet-inequality algorithms become equivalent relative to the ex ante benchmark. This suggests that, for many feasibility constraints, the cost of fixing local probing behavior ex ante is controlled by structural quantities from free-information stochastic optimization rather than by arbitrary losses from reduced adaptivity (Chawla et al., 27 Aug 2025).

Current open directions are stated explicitly in the papers. For the commitment-gap line, these include tightening constants for knapsack and $\sigma_i$8-systems, extending the framework to richer packing constraints, understanding minimization CICS beyond the unbounded commitment-gap examples, and studying intermediate models between full adaptivity and full commitment. The paper also identifies correlated values and learning-based settings as natural extensions beyond the product-distribution regime (Chawla et al., 27 Aug 2025). For the broader MDP-composition framework, open questions include sharper local or semilocal approximation factors, extension beyond matroids and frugal combinatorial structures, infinite-horizon variants, and correlated-value models (Chawla et al., 2024).

Taken together, these developments position CICS as a unifying theory for combinatorial decision-making under explicit information-acquisition cost. Its modern form combines MDP-level modeling of inspection, surrogate-value or surrogate-cost amortization, local approximation for committed exploration, and structural reductions to prophet inequalities, correlation gap, and free-information combinatorial optimization.