Abstract
The information diffusion game, which is a type of non-cooperative game, models the diffusion process of information in networks for several competitive firms that want to spread their information. Recently, the game on weighted graphs was introduced and pure Nash equilibria for the game were discussed. This paper gives a full characterization of the existence of pure Nash equilibria for the game on weighted cycles and paths according to the number of vertices, the number of players and weight classes.
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 callMore From: Journal of the Operations Research Society of Japan
Disclaimer: 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.
