Skip to main content
Log in

A Multiple Access Game with Incomplete Information

  • MATHEMATICAL GAME THEORY AND APPLICATIONS
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

We propose a data transmission model in a special topology network in which two players (network nodes) seek to send as many randomly appearing data packets as possible through a common node. It is assumed that the players do not have complete information about whether the other player has a data packet for possible transfer. For the solution, it is proposed to use cooperative and noncooperative approaches in accordance with which a cooperative solution and Nash equilibrium are found. The price of anarchy is calculated to compare the total payoffs of the players in the cooperative solution and the Nash equilibrium.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1.
Fig. 2.
Fig. 3.

Similar content being viewed by others

REFERENCES

  1. Bellman, R., Dynamic Programming, Princeton: Princeton Univ. Press, 1957. Translated under the title: Dinamicheskoe programmirovanie, Moscow: Izd. Inostr. Lit., 1960.

    MATH  Google Scholar 

  2. Bure, V.M. and Parilina, E.M., Stochastic models of data transmission in networks with different topologies, Upr. Bol’shimi Sist., 2017, no. 68, pp. 6–29.

  3. Parilina, E.M., Cooperative data transfer game in a wireless network, Mat. Teoriya Igr Pril., 2009, vol. 1, no. 4, pp. 93–110.

    MATH  Google Scholar 

  4. Chirkova, Yu.V., The price of anarchy in a load balance game in a system with three machines, Mat. Teoriya Igr Pril., 2014, vol. 6, no. 4, pp. 85–96.

    MathSciNet  MATH  Google Scholar 

  5. Abramson, N.M., The ALOHA system: Another alternative for computer communications, Proc. Fall Joint Comput. Conf. AFIPS’70 (New York: November 17–19, 1970), ACM, 1970, pp. 281–285.

  6. Altman, E., El Azouzi, R., and Jiménez, T., Slotted Aloha as a game with partial information, Comput. Networks, 2004, vol. 45, no. 6, pp. 701–713.

  7. Bazenkov, N.I., Double best response dynamics in topology formation game for ad hoc networks, Autom. Remote Control, 2015, vol. 76, no. 2, pp. 323–335.

    Article  MathSciNet  MATH  Google Scholar 

  8. Buttyan, L. and Hubaux, J.-P., Security and Cooperation in Wireless Networks: Thwarting Malicious and Selfish Behavior in the Age of Ubiquitous Computing, New York: Cambridge Univ. Press, 2007.

    Book  Google Scholar 

  9. Fink, A.M., Equilibrium in a stochastic \(n \)-person game, J. Sci. Hiroshima Univ. Ser. A-I Math., 1964, vol. 28, no. 1, pp. 89–93.

    MathSciNet  MATH  Google Scholar 

  10. Inaltekin, H. and Wicker, S.B., The analysis of Nash equilibria of the one-shot random-access game for wireless networks and the behavior of selfish nodes, IEEE/ACM Trans. Networking, 2008, vol. 16, no. 5, pp. 1094–1107.

    Article  Google Scholar 

  11. Koutsoupias, E. and Papadimitriou, C., Worst-case equilibria, Proc. 16th Annu. Symp. Theor. Aspects Comput. Sci. (1999), pp. 404–413.

  12. MacKenzie, A.B. and Wicker, S.B., Selfish users in Aloha: a game-theoretic approach, Proc. IEEE 54th Vehicular Technol. Conf. 2001 (Atlantic City, NJ: Fall 2001), vol. 3, pp. 1354–1357.

  13. Marbán, S., van de Ven, P., Borm, P., and Hamers, H., ALOHA networks: a game-theoretic approach, Math. Meth. Oper. Res., 2013, vol. 78, no. 2, pp. 221–242.

  14. Parilina, E.M. and Tampieri, A., Stability and cooperative solution in stochastic games, Theory Decis., 2017, vol. 84, pp. 601–625.

    Article  MathSciNet  MATH  Google Scholar 

  15. Petrosjan, L.A. and Baranova, E.M., Cooperative stochastic games in stationary strategies, Game Theory Appl., 2006, vol. 11, pp. 7–17.

    Google Scholar 

  16. Sagduyu, Y.E. and Ephremides, A., A game-theoretic look at simple relay channel, Wireless Networks, 2006, vol. 12, no. 5, pp. 545–560.

    Article  Google Scholar 

  17. Shapley, L.S., Stochastic games, Proc. Natl. Acad. Sci. USA, 1953, vol. 39, pp. 1095–1100.

    Article  MathSciNet  MATH  Google Scholar 

  18. Takahashi, M., Stochastic games with infinitely many strategies, J. Sci. Hiroshima Univ. Ser. A-I Math., 1964, vol. 28, pp. 95–99.

    MathSciNet  Google Scholar 

  19. https://www.wolfram.com/mathematica/.

Download references

Funding

This work was supported by the Russian Science Foundation, project no. 17-11-01079.

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to V. M. Bure or E. M. Parilina.

Additional information

Translated by V. Potapchouck

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bure, V.M., Parilina, E.M. A Multiple Access Game with Incomplete Information. Autom Remote Control 83, 1467–1475 (2022). https://doi.org/10.1134/S0005117922090090

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117922090090

Keywords

Navigation