On the Asymptotic Behavior of Selfish Transmitters Sharing a Common Channel
Information Theory
2016-11-15 v1 Computer Science and Game Theory
math.IT
Abstract
This paper analyzes the asymptotic behavior of a multiple-access network comprising a large number of selfish transmitters competing for access to a common wireless communication channel, and having different utility functions for determining their strategies. A necessary and sufficient condition is given for the total number of packet arrivals from selfish transmitters to converge in distribution. The asymptotic packet arrival distribution at Nash equilibrium is shown to be a mixture of a Poisson distribution and finitely many Bernoulli distributions.
Keywords
Cite
@article{arxiv.0804.4187,
title = {On the Asymptotic Behavior of Selfish Transmitters Sharing a Common Channel},
author = {Hazer Inaltekin and Mung Chiang and Harold Vincent Poor and Stephen B. Wicker},
journal= {arXiv preprint arXiv:0804.4187},
year = {2016}
}
Comments
Proceedings of the 2008 IEEE International Symposium on Information Theory, Toronto, ON, Canada, July 6 - 11, 2008