Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
1.4
0.9
Journals
Games
Special Issues
Applications of Game Theory to Networks
share announcement

Applications of Game Theory to Networks

A special issue of Games (ISSN 2073-4336).

Deadline for manuscript submissions: closed (1 May 2018)

Special Issue Editors

Dr. Tomasz P. Michalak

E-Mail Website
Guest Editor
Institute of Informatics, University of Warsaw, ul. Banacha 2, 02-097 Warsaw, Poland
Interests: cooperative game theory; auctions (especially all-pay auctions); game theory applied to social networks; game theory applied to artificial intelligence; game theory in big data and fintech applications; computational aspects of cooperative games
Dr. Marcin Dziubiński

E-Mail Website
Guest Editor
Institute of Informatics, University of Warsaw, ul. Banacha 2, 02-097 Warsaw, Poland
Interests: Networks, Conflicts with multiple battlefields, Location games, Game theory, Multi-agent systems

Special Issue Information

Dear Colleagues,

In recent years, we have witnessed a growing interest in the use of concepts, solutions and apparatus from game theory in the network context. The applications include such diverse areas as centrality analysis, community detection, link prediction, network elicitation, cost-sharing, security, competitive contagion, conflict in networks, network formation and network design. In this call, we would like to invite original research papers to a Special Issue of Games on advances and applications of game theory to networks.    We believe this Special Issue will be a valuable addition to the literature. We envisage a broad scope for this Special Issue, and we will consider all submissions that report on the use game theoretic concepts to network analysis. Please consider keywords below as merely indicative.

Dr. Tomasz P. Michalak
Dr. Marcin Dziubiński
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Games is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • Network games
  • Network security
  • Conflict in networks
  • Cost-sharing in networks
  • Network formation and network creation
  • Competitive viral-marketing
  • Game-theoretic models for community detection
  • Game-theoretic centrality
  • Strategic evasion of social network analysis tools

Published Papers (1 paper)

Order results
Result details
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:

Research

13 pages, 290 KiB  
Article
A Game-Theoretic Approach for Modeling Competitive Diffusion over Social Networks
by Shahla Jafari and Hamidreza Navidi
Games 2018, 9(1), 8; https://doi.org/10.3390/g9010008 - 13 Feb 2018
Cited by 19 | Viewed by 5541
Abstract
In this paper, we consider a novel game theory model for the competitive influence maximization problem. We model this problem as a simultaneous non-cooperative game with complete information and rational players, where there are at least two players who are supposed to be [...] Read more.
In this paper, we consider a novel game theory model for the competitive influence maximization problem. We model this problem as a simultaneous non-cooperative game with complete information and rational players, where there are at least two players who are supposed to be out of the network and are trying to institutionalize their options in the social network; that is, the objective of players is to maximize the spread of a desired opinion rather than the number of infected nodes. In the proposed model, we extend both the Linear Threshold model and the Independent Cascade model. We study an influence maximization model in which users’ heterogeneity, information content, and network structure are considered. Contrary to previous studies, in the proposed game, players find not only the most influential initial nodes but also the best information content. The proposed novel game was implemented on a real data set where individuals have different tendencies toward the players’ options that change over time because of gaining influence from their neighbors and the information content they receive. This means that information content, the topology of the graph, and the individual’s initial tendency significantly affect the diffusion process. The proposed game is solved and the Nash equilibrium is determined for a real data set. Lastly, the numerical results obtained from the proposed model were compared with some well-known models previously reported in the literature. Full article
(This article belongs to the Special Issue Applications of Game Theory to Networks)
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
 
Displaying articles 1-1
Back to TopTop