Log In Sign Up

Buying Data Over Time: Approximately Optimal Strategies for Dynamic Data-Driven Decisions

by   Nicole Immorlica, et al.

We consider a model where an agent has a repeated decision to make and wishes to maximize their total payoff. Payoffs are influenced by an action taken by the agent, but also an unknown state of the world that evolves over time. Before choosing an action each round, the agent can purchase noisy samples about the state of the world. The agent has a budget to spend on these samples, and has flexibility in deciding how to spread that budget across rounds. We investigate the problem of choosing a sampling algorithm that optimizes total expected payoff. For example: is it better to buy samples steadily over time, or to buy samples in batches? We solve for the optimal policy, and show that it is a natural instantiation of the latter. Under a more general model that includes per-round fixed costs, we prove that a variation on this batching policy is a 2-approximation.


page 1

page 2

page 3

page 4


Efficiently Solving MDPs with Stochastic Mirror Descent

We present a unified framework based on primal-dual stochastic mirror de...

Beyond Adaptive Submodularity: Adaptive Influence Maximization with Intermediary Constraints

We consider a brand with a given budget that wants to promote a product ...

Optimal sampling and assay for soil organic carbon estimation

The world needs around 150 Pg of negative carbon emissions to mitigate c...

Risk-Aware Bid Optimization for Online Display Advertisement

This research focuses on the bid optimization problem in the real-time b...

Proportionally Fair Online Allocation of Public Goods with Predictions

We design online algorithms for the fair allocation of public goods to a...

Resource Sharing Through Multi-Round Matchings

Applications such as employees sharing office spaces over a workweek can...

Online Search with Maximum Clearance

We study the setting in which a mobile agent must locate a hidden target...