Abstract
A Gaussian multiple access wire-tap channel with confidential messages is studied, where multiple users attempt to transmit private messages to a legitimate receiver in the presence of an eavesdropper. While prior work focused on the case where the users were cooperative, we assume that each user is selfish and and so are modeled as playing a non-cooperative game. We assume all users send a superposition of two Gaussian codebooks: one for their confidential messages and one for 'filling' the evesdropper's channel. For such a scheme, we give a characterization of the achievable rate region defined by Tekin and Yener using polymatroid properties. We then use this to find the Nash equilibrium region for this non-cooperative game. Furthermore, we give algorithms for finding the best and worst Nash equilibria for a given channel.
Original language | English (US) |
---|---|
Title of host publication | Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 111-115 |
Number of pages | 5 |
ISBN (Electronic) | 9781467377041 |
DOIs | |
State | Published - Sep 28 2015 |
Event | IEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong Duration: Jun 14 2015 → Jun 19 2015 |
Publication series
Name | IEEE International Symposium on Information Theory - Proceedings |
---|---|
Volume | 2015-June |
ISSN (Print) | 2157-8095 |
Other
Other | IEEE International Symposium on Information Theory, ISIT 2015 |
---|---|
Country/Territory | Hong Kong |
City | Hong Kong |
Period | 6/14/15 → 6/19/15 |
Funding
This work was supported in part by the National Science Foundation grant TWC-1314620
ASJC Scopus subject areas
- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics