Skip to main content

Learning Equilibria of a Stochastic Game on Gaussian Interference Channels with Incomplete Information

  • Conference paper
  • First Online:
  • 718 Accesses

Part of the book series: Static & Dynamic Game Theory: Foundations & Applications ((SDGTFA))

Abstract

We consider a wireless communication system in which N transmitter-receiver pairs want to communicate with each other. Each transmitter transmits data using a power that depends on the channel gain to its receiver. If a receiver can successfully receive the message, it sends an acknowledgement (ACK), else it sends a negative ACK (NACK). Each user aims to maximize its probability of successful transmission. We formulate this problem as a stochastic game and propose a fully distributed learning algorithm to find a correlated equilibrium (CE); and we use a no regret algorithm to find a coarse correlated equilibrium (CCE). We compare the sum rate obtained at the CE, CCE, and a Pareto point, and also via some other well known recent algorithms.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. G. Scutari, D. P. Palomar, and S. Barbarossa, “Asynchronous Iterative Water-Filling for Gaussian Frequency-Selective Interference Channels”, IEEE Trans on Information Theory, Vol.54, No.7, July 2008.

    Google Scholar 

  2. L. Rose, S. M. Perlaza, and M. Debbah, “On the Nash Equilibria in Decentralized Parallel Interference Channels,” Proc. of International Conference on Communications, Kyoto, 2011.

    Google Scholar 

  3. A. K. Chaitanya, V. Sharma, and U. Mukherji, “Distributed Learning of Equilibria for a Stochastic Game on Interference Channels,” IEEE SPAWC, KTH, Stockholm, Sweden, 2015.

    Google Scholar 

  4. S. Lasaulce, and H. Tembine, “Game Theory and Learning for Wireless Networks: Fundamentals and Applications,” Elsevier, 2011.

    Google Scholar 

  5. S. Hart, and A. Mas-Colell, “A Simple Adaptive Procedure Leading to Correlated Equilibrium,” Econometrica, Vol. 68, No.5, pp. 1127–1150, Sept. 2000.

    Google Scholar 

  6. D. Fudenberg, and D. M. Kreps, “Learning Mixed Equilibria,” Games and Economic Behavior, vol. 5, pp. 320–367, 1993.

    Article  MathSciNet  MATH  Google Scholar 

  7. S. Hart, and A. Mas-Colell, “A Reinforcement Procedure Leading to Correlated Equilibrium,” Economics Essays, Springer Berlin Heidelberg, 2001.

    MATH  Google Scholar 

  8. B. S. R. Pradelski, and H. P. Young, “Learning Efficient Nash Equilibria in Distributed Systems,” Games and Economic Behavior Elsevier, 75, pp.882–897, 2012.

    MATH  Google Scholar 

  9. H. P. Young, “Learning by Trial and Error,” Games and Economic Behavior, Elsevier, 65, pp.626–643, 2009.

    MATH  Google Scholar 

  10. T. Borgers, and R. Sarin, “Learning Through Reinforcement Learning and Replicator Dynamics,” Journal of Economic Theory, 77, pp.1–14, 1997.

    Article  MathSciNet  MATH  Google Scholar 

  11. W. B. Arthur, “On Designing Economic Agents that Behave like Human Agents,” Journal of Evolutionary Economics, Springer-Verlag, pp.1–22, 1993.

    Google Scholar 

  12. S. Hart, “Adaptive Heuristics,” Econometrica, Vol. 73, No. 5, pp. 1401–1430, September, 2005.

    Google Scholar 

  13. A. K. Chaitanya, V. Sharma, and U. Mukherji, “Learning Equilibria of a Stochastic Game on Gaussian Interference Channels with Incomplete Information,” available at https://arxiv.org/abs/1503.02839.

  14. S. Arora, E. Hazan, and S. Kale, “The Multiplicative Weights update method: a meta algorithm and applications,” Theory of Computing, 8(1), pp 121–164, 2012.

    Article  MathSciNet  MATH  Google Scholar 

  15. N. Cesa-Bianchi, and G. Lugosi, “Prediction, Learning, and Games,” Cambridge University Press, 2006.

    MATH  Google Scholar 

  16. T. Roughgarden, “Intrinsic Robustness of the Price of Anarchy,” ACM Symposium on Theory of Computing, pp.513–522, 2009.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A Krishna Chaitanya .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Chaitanya, A.K., Mukherji, U., Sharma, V. (2017). Learning Equilibria of a Stochastic Game on Gaussian Interference Channels with Incomplete Information. In: Lasaulce, S., Jimenez, T., Solan, E. (eds) Network Games, Control, and Optimization. NETGCOOP 2016. Static & Dynamic Game Theory: Foundations & Applications. Birkhäuser, Cham. https://doi.org/10.1007/978-3-319-51034-7_15

Download citation

Publish with us

Policies and ethics