Game-Theoretic Pricing and Selection with Fading Channels

10/15/2017
by   Yuqing Ni, et al.
0

We consider pricing and selection with fading channels in a Stackelberg game framework. A channel server decides the channel prices and a client chooses which channel to use based on the remote estimation quality. We prove the existence of an optimal deterministic and Markovian policy for the client, and show that the optimal policies of both the server and the client have threshold structures when the time horizon is finite. Value iteration algorithm is applied to obtain the optimal solutions for both the server and client, and numerical simulations and examples are given to demonstrate the developed result.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/06/2020

Splintering with distributions: A stochastic decoy scheme for private computation

Performing computations while maintaining privacy is an important proble...
research
05/05/2021

Optimal Pricing in Multi Server Systems

We study optimal service pricing in server farms where customers arrive ...
research
12/22/2020

The Value of Information and Efficient Switching in Channel Selection

We consider a collection of statistically identical two-state continuous...
research
12/10/2018

Impossibility of blind quantum sampling for classical client

Blind quantum computing enables a client, who can only generate or measu...
research
08/13/2022

VegaFusion: Automatic Server-Side Scaling for Interactive Vega Visualizations

The Vega grammar has been broadly adopted by a growing ecosystem of brow...
research
10/16/2022

D/M/1 Queue: Policies and Control

Equilibrium G/M/1-FIFO waiting times are exponentially distributed, as f...
research
05/09/2023

Opportunistic Mutual Exclusion

Mutual exclusion is an important problem in the context of shared resour...

Please sign up or login with your details

Forgot password? Click here to reset