The Value of Information and Efficient Switching in Channel Selection

12/22/2020
by   Jiesen Wang, et al.
0

We consider a collection of statistically identical two-state continuous time Markov chains (channels). A controller continuously selects a channel with the view of maximizing infinite horizon average reward. A switching cost is paid upon channel changes. We consider two cases: full observation (all channels observed simultaneously) and partial observation (only the current channel observed). We analyze the difference in performance between these cases for various policies. For the partial observation case with two channels, or an infinite number of channels, we explicitly characterize an optimal threshold for two sensible policies which we name "call-gapping" and "cool-off". Our results present a qualitative view on the interaction of the number of channels, the available information, and the switching costs.

READ FULL TEXT
research
08/03/2009

Regret Bounds for Opportunistic Channel Access

We consider the task of opportunistic channel access in a primary system...
research
10/15/2017

Game-Theoretic Pricing and Selection with Fading Channels

We consider pricing and selection with fading channels in a Stackelberg ...
research
05/11/2023

Commitment over Gaussian Unfair Noisy Channels

Commitment is a key primitive which resides at the heart of several cryp...
research
02/07/2022

Channel Capacity for Adversaries with Computationally Bounded Observations

We study reliable communication over point-to-point adversarial channels...
research
10/16/2017

SpecWatch: A Framework for Adversarial Spectrum Monitoring with Unknown Statistics

In cognitive radio networks (CRNs), dynamic spectrum access has been pro...
research
03/16/2023

Anomaly Search Over Many Sequences With Switching Costs

This paper considers the quickest search problem to identify anomalies a...
research
11/02/2020

Optimal Policies for the Homogeneous Selective Labels Problem

Selective labels are a common feature of consequential decision-making a...

Please sign up or login with your details

Forgot password? Click here to reset