IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v61y2016i4d10.1007_s11235-015-0043-4.html
   My bibliography  Save this article

Game theoretic power allocation for fading MIMO multiple access channels with imperfect CSIR

Author

Listed:
  • Samira Mir Mazhari Anvar

    (University of Tabriz)

  • Sohrab Khanmohammadi

    (University of Tabriz)

  • Javad Musevi niya

    (University of Tabriz)

Abstract

In this paper, we formulate the power allocation (PA) problem for uplink of MIMO fading multiple access channels using a game theoretic framework with channel estimation error at receiver side. We investigate the effect of the error on derived PA policy and on performance of the system. Furthermore, it is assumed that the CSI at transmitter side is imperfect i.e., each transmitter is informed with the statistics of the channels instead of the instantaneous channel states. We use lower bound of mutual information between each user and the base station to derive a utility function for the concave game, regarding the channel estimation error. Following the formulation of problem, existence and uniqueness of the game’s equilibrium are investigated and it is proved that the proposed game has a unique Nash equilibrium (NE). Also a primal-dual subgradient based best-response algorithm is designed to find the NE. The algorithm updates the policy of each player regarding the given policy of other players, at each iteration. Finally, simulation results of the achieved PA policy are illustrated to investigate the effect of channel estimation error. In particular, simulations show that the overall system performance will be improved when channel estimation error in modeling the PA game is considered.

Suggested Citation

  • Samira Mir Mazhari Anvar & Sohrab Khanmohammadi & Javad Musevi niya, 2016. "Game theoretic power allocation for fading MIMO multiple access channels with imperfect CSIR," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 61(4), pages 875-886, April.
    • Handle: RePEc:spr:telsys:v:61:y:2016:i:4:d:10.1007_s11235-015-0043-4
    DOI: 10.1007/s11235-015-0043-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-015-0043-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11235-015-0043-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. A. Nedić & A. Ozdaglar, 2009. "Subgradient Methods for Saddle-Point Problems," Journal of Optimization Theory and Applications, Springer, vol. 142(1), pages 205-228, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. I. M. M. Souza & M. L. M. G. Alcoforado & V. C. Rocha, 2018. "Turbo decoding of simple product codes in a two user binary adder channel employing the Bahl–Cocke–Jelinek–Raviv algorithm," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 68(3), pages 513-521, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Avinash N. Madavan & Subhonmesh Bose, 2021. "A Stochastic Primal-Dual Method for Optimization with Conditional Value at Risk Constraints," Journal of Optimization Theory and Applications, Springer, vol. 190(2), pages 428-460, August.
    2. Vinayaka G. Yaji & Shalabh Bhatnagar, 2020. "Stochastic Recursive Inclusions in Two Timescales with Nonadditive Iterate-Dependent Markov Noise," Mathematics of Operations Research, INFORMS, vol. 45(4), pages 1405-1444, November.
    3. Liusheng Hou & Hongjin He & Junfeng Yang, 2016. "A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA," Computational Optimization and Applications, Springer, vol. 63(1), pages 273-303, January.
    4. Guigues, Vincent & Shapiro, Alexander & Cheng, Yi, 2023. "Duality and sensitivity analysis of multistage linear stochastic programs," European Journal of Operational Research, Elsevier, vol. 308(2), pages 752-767.
    5. Andrea Simonetto & Hadi Jamali-Rad, 2016. "Primal Recovery from Consensus-Based Dual Decomposition for Distributed Convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 168(1), pages 172-197, January.
    6. Bo Wei & William B. Haskell & Sixiang Zhao, 2020. "An inexact primal-dual algorithm for semi-infinite programming," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 91(3), pages 501-544, June.
    7. Guangming Zhou & Qin Wang & Wenjie Zhao, 2020. "Saddle points of rational functions," Computational Optimization and Applications, Springer, vol. 75(3), pages 817-832, April.
    8. Hu, Mian & Wang, Yan-Wu & Xiao, Jiang-Wen & Lin, Xiangning, 2019. "Multi-energy management with hierarchical distributed multi-scale strategy for pelagic islanded microgrid clusters," Energy, Elsevier, vol. 185(C), pages 910-921.
    9. Yaohua Hu & Jiawen Li & Carisa Kwok Wai Yu, 2020. "Convergence rates of subgradient methods for quasi-convex optimization problems," Computational Optimization and Applications, Springer, vol. 77(1), pages 183-212, September.
    10. A. M. Bagirov & L. Jin & N. Karmitsa & A. Al Nuaimat & N. Sultanova, 2013. "Subgradient Method for Nonconvex Nonsmooth Optimization," Journal of Optimization Theory and Applications, Springer, vol. 157(2), pages 416-435, May.
    11. Desmond Cai & Subhonmesh Bose & Adam Wierman, 2019. "On the Role of a Market Maker in Networked Cournot Competition," Mathematics of Operations Research, INFORMS, vol. 44(3), pages 1122-1144, August.
    12. Giorgio Costa & Roy H. Kwon, 2021. "Data-driven distributionally robust risk parity portfolio optimization," Papers 2110.06464, arXiv.org.
    13. Denizalp Goktas & Amy Greenwald, 2022. "Gradient Descent Ascent in Min-Max Stackelberg Games," Papers 2208.09690, arXiv.org.
    14. Denizalp Goktas & Jiayi Zhao & Amy Greenwald, 2022. "Robust No-Regret Learning in Min-Max Stackelberg Games," Papers 2203.14126, arXiv.org, revised Apr 2022.
    15. J. Y. Bello Cruz & P. S. M. Santos & S. Scheimberg, 2013. "A Two-Phase Algorithm for a Variational Inequality Formulation of Equilibrium Problems," Journal of Optimization Theory and Applications, Springer, vol. 159(3), pages 562-575, December.
    16. Wenjie Zhao & Guangming Zhou, 2022. "Local saddle points for unconstrained polynomial optimization," Computational Optimization and Applications, Springer, vol. 82(1), pages 89-106, May.
    17. Regina S. Burachik & Alfredo N. Iusem & Jefferson G. Melo, 2013. "An Inexact Modified Subgradient Algorithm for Primal-Dual Problems via Augmented Lagrangians," Journal of Optimization Theory and Applications, Springer, vol. 157(1), pages 108-131, April.
    18. Le Thi Khanh Hien & Renbo Zhao & William B. Haskell, 2024. "An Inexact Primal-Dual Smoothing Framework for Large-Scale Non-Bilinear Saddle Point Problems," Journal of Optimization Theory and Applications, Springer, vol. 200(1), pages 34-67, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:telsys:v:61:y:2016:i:4:d:10.1007_s11235-015-0043-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.