Abstract
For networking games, a primary tool of analysis is game-theoretic methods. The central role is played by the concept of equilibrium. The basic notions of game theory include Players, Strategies, and Payoffs. In network games, players can be programs, mobile phones, or members of social networks. Strategies can be the choice of a path in a graph, the level of a signal, the formation of links in a graph. This chapter presents the examples of networking games, the concept of Nash equilibrium, gives the basic definitions and proves the theorem of the existence of equilibrium in convex games.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
