Quantized Mechanisms for Gaussian Multiple Access Wiretap Channels

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Economic mechanisms have been widely studied for allocating network resources while accounting for the incentives of self-interested users. Indeed, the well known Vickrey-Clarke-Groves (VCG) mechanism provides an elegant solution to such problems with a strong incentive guarantee. However, VCG mechanisms can incur high communication costs. Recent work has shown that via quantization, one can reduce the communication costs of VCG while maintaining its incentive guarantees for allocating a single divisible resource. However, in many information theoretic settings, the underlying resource constraints are more complex. Here, we consider developing similar quantized mechanisms for one such setting: a Gaussian multiple access wiretap channel. Namely, we seek to allocate secure rates to a set of users assuming that all users employ a superposition coding scheme. This results in an achievable rate region that we show is a polymatroid. We utilize this characterization to design a quantized mechanism with strong incentive properties.

Original languageEnglish (US)
Title of host publication2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages5
ISBN (Electronic)9781538692912
StatePublished - Jul 2019
Event2019 IEEE International Symposium on Information Theory, ISIT 2019 - Paris, France
Duration: Jul 7 2019Jul 12 2019

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095


Conference2019 IEEE International Symposium on Information Theory, ISIT 2019

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Quantized Mechanisms for Gaussian Multiple Access Wiretap Channels'. Together they form a unique fingerprint.

Cite this