Related papers: A Game Theoretic Perspective on Network Topologies
Evolutionary game theory is employed to study topological conditions of scale-free networks for the evolution of cooperation. We show that Apollonian Networks (ANs) are perfect scale-free networks, on which cooperation can spread to all…
We establish average consensus on graphs with dynamic topologies prescribed by evolutionary games among strategic agents. Each agent possesses a private reward function and dynamically decides whether to create new links and/or whether to…
We propose a novel method for topological analysis of unweighted graphs which is based on \textit{persistent homology}. The proposed method maps the input graph to a complete weighted graph where the weighting function maps each edge to a…
Despite the tremendous success of graph-based learning systems in handling structural data, it has been widely investigated that they are fragile to adversarial attacks on homophilic graph data, where adversaries maliciously modify the…
In this work we address graph based semi-supervised learning using the theory of the spatial segregation of competitive systems. First, we define a discrete counterpart over connected graphs by using direct analogue of the corresponding…
Communication networks are essential for our economy and our everyday lives. This makes them lucrative targets for attacks. Today, we see an ongoing battle between criminals that try to disrupt our key communication networks and security…
A growing body of literature in networked systems research relies on game theory and mechanism design to model and address the potential lack of cooperation between self-interested users. Most game-theoretic models applied to system…
We propose in this paper a coinvestment plan between several stakeholders of different types, namely a physical network owner, operating network nodes, e.g. a network operator or a tower company, and a set of service providers willing to…
We construct a model of strategic imitation in an arbitrary network of players who interact through an additive game. Assuming a discrete time update, we show a condition under which the resulting difference equations converge to consensus.…
We propose a model of discrete time dynamic congestion games with atomic players and a single source-destination pair. The latencies of edges are composed by free-flow transit times and possible queuing time due to capacity constraints. We…
We consider the size and structure of the automorphism groups of a variety of empirical `real-world' networks and find that, in contrast to classical random graph models, many real-world networks are richly symmetric. We relate automorphism…
In this paper we study a model of weighted network formation. The bilateral interaction is modeled as a Tullock contest game with the possibility of a draw. We describe stable networks under different concepts of stability. We show that a…
Social networks offer users new means of accessing information, essentially relying on "social filtering", i.e. propagation and filtering of information by social contacts. The sheer amount of data flowing in these networks, combined with…
We study a network formation game where $n$ players, identified with the nodes of a directed graph to be formed, choose where to wire their outgoing links in order to maximize their PageRank centrality. Specifically, the action of every…
We consider how selfish agents are likely to share revenues derived from maintaining connectivity between important network servers. We model a network where a failure of one node may disrupt communication between other nodes as a…
The formal study of coalition formation in multi-agent systems is typically realized in the framework of hedonic games, which originate from economic theory. The main focus of this branch of research has been on the existence and the…
Neural networks are often represented as graphs of connections between neurons. However, despite their wide use, there is currently little understanding of the relationship between the graph structure of the neural network and its…
Governments and enterprises strongly rely on incentives to generate favorable outcomes from social and strategic interactions between individuals. The incentives are usually modeled by payoffs in evolutionary games, such as the prisoner's…
How do rational agents self-organize when trying to connect to a common target? We study this question with a simple tree formation game which is related to the well-known fair single-source connection game by Anshelevich et al. (FOCS'04)…
In this work, we aim to understand the mechanisms driving academic collaboration. We begin by building a model for how researchers split their effort between multiple papers, and how collaboration affects the number of citations a paper…