DocumentCode
1634032
Title
Achieving socially optimal solution through payments in a dynamic game for the relay channel
Author
Vasal, Deepanshu ; Anastasopoulos, Achilleas
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., Univ. of Michigan, Ann Arbor, MI, USA
fYear
2012
Firstpage
1640
Lastpage
1644
Abstract
In this paper we study a simple relay channel where a transmitter can transmit a packet directly to the receiver or transmit through the relay. In such a case, there is an inherent trade-off between energy and delay since transmitting a packet directly to the receiver may consume more energy than transmitting through a relay whereas transmission through relay incurs more delay. We consider two cases; when nodes are cooperative and when nodes are strategic. We show that when nodes are strategic, there exist payment transfer functions to be exchanged between the nodes such that the socially optimal Markov policy is the unique sub game perfect equilibrium of the resulting dynamic game.
Keywords
Markov processes; cooperative communication; game theory; relay networks (telecommunication); wireless channels; dynamic game; receiver; relay channel; socially optimal Markov policy; subgame perfect equilibrium; transmitter; Delays; Games; Markov processes; Nash equilibrium; Receivers; Relays; Transmitters;
fLanguage
English
Publisher
ieee
Conference_Titel
Communication, Control, and Computing (Allerton), 2012 50th Annual Allerton Conference on
Conference_Location
Monticello, IL
Print_ISBN
978-1-4673-4537-8
Type
conf
DOI
10.1109/Allerton.2012.6483418
Filename
6483418
Link To Document