On the steady state solution of a two-by-two dynamic jamming game with cumulative power constraints

Mallik, R; Scholtz, R; Papavassilopoulos, G

dc.contributor.author	Mallik, R	en
dc.contributor.author	Scholtz, R	en
dc.contributor.author	Papavassilopoulos, G	en
dc.date.accessioned	2014-03-01T02:47:58Z
dc.date.available	2014-03-01T02:47:58Z
dc.date.issued	1991	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33477
dc.subject	cumulant	en
dc.subject	Discrete Time	en
dc.subject	Dynamic Game	en
dc.subject	Game Playing	en
dc.subject	Steady State	en
dc.title	On the steady state solution of a two-by-two dynamic jamming game with cumulative power constraints	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/ACSSC.1991.186574	en
heal.identifier.secondary	http://dx.doi.org/10.1109/ACSSC.1991.186574	en
heal.publicationDate	1991	en
heal.abstract	It is noted that the process of jamming can be modeled as a two-person zero-sum noncooperative dynamic game played between a communicator and a jammer over a number of discrete time instants. The simplest case is when, at each instant, the communicator and jammer randomize their strategies between idleness and transmission. The payoff (throughput) matrix is then two-by-two, with one	en
heal.journalName	Asilomar Conference on Signals, Systems & Computers	en
dc.identifier.doi	10.1109/ACSSC.1991.186574	en