2019
DOI: 10.1007/978-3-030-17953-3_18
|View full text |Cite
|
Sign up to set email alerts
|

The Markovian Price of Information

Abstract: Suppose there are n Markov chains and we need to pay a per-step price to advance them. The "destination" states of the Markov chains contain rewards; however, we can only get rewards for a subset of them that satisfy a combinatorial constraint, e.g., at most k of them, or they are acyclic in an underlying graph. What strategy should we choose to advance the Markov chains if our goal is to maximize the total reward minus the total price that we pay? In this paper we introduce a Markovian price of information mo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(8 citation statements)
references
References 40 publications
0
8
0
Order By: Relevance
“…Recent works [KWW16,Sin18] studied the problem under richer combinatorial constraints. Gupta et al [GJSS19] study a more general problem: there is a given packing constraint F ⊆ 2 [𝑛] (e.g., matroid, matching, knapsack) of subsets of chains. e goal is to make a subset 𝑆 of chains to reach their targets (𝑆 ∈ F ), while minimizing the dis-utility (with upward-closed constraint) or maximize the utility (with downward-closed constraint).…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Recent works [KWW16,Sin18] studied the problem under richer combinatorial constraints. Gupta et al [GJSS19] study a more general problem: there is a given packing constraint F ⊆ 2 [𝑛] (e.g., matroid, matching, knapsack) of subsets of chains. e goal is to make a subset 𝑆 of chains to reach their targets (𝑆 ∈ F ), while minimizing the dis-utility (with upward-closed constraint) or maximize the utility (with downward-closed constraint).…”
Section: Related Workmentioning
confidence: 99%
“…Now we de ne a prevailing cost [DTW03] and an epoch [GJSS19]. A trajectory is a sequence of states in a Markov system traversed by a player.…”
Section: Gradementioning
confidence: 99%
“…Singla [16] also studied the problem of maximizing the buyer's profit when information is available at a price, but also can only be purchased at full price, which can be considered as a simpler form of our problem and is used as a baseline in our experiments. In [9], Gupta et. al extends on the capability of purchasing the same data multiple times.…”
Section: Formal Definitionmentioning
confidence: 99%
“…In the first phase, the buyer would buy all available data points in a large bounding box around the target region at a small starting price 0 (lines [2][3][4][5][6][7][8][9]). Then in the second phase (lines ), the buyer repeatedly calculates EIPs (lines [10][11][12][13]), takes a buying action based on the high potential EIPs (line [15,27]) and uses the newly purchased noisy data, if any, to guide the next action (line [19,29]).…”
Section: 31mentioning
confidence: 99%
See 1 more Smart Citation