Related papers: On Using Matching Theory to Understand P2P Network…
Peer-To-Peer (P2P) networks are self-organizing, distributed systems, with no centralized authority or infrastructure. Because of the voluntary participation, the availability of resources in a P2P system can be highly variable and…
Transmission Control Protocol (TCP) continues to be the dominant transport protocol on the Internet. The stability of fluid models has been a key consideration in the design of TCP and the performance evaluation of TCP algorithms. Based on…
In this work, we analyse and predict the stability of communities in complex networks. We use a variant of closeness centrality, known as profile closeness, to measure the loyalty of a member towards its community. We show that the profile…
Understanding the emergence and sustainability of cooperation is a fundamental problem in evolutionary biology and is frequently studied by the framework of evolutionary game theory. A very powerful mechanism to promote cooperation is…
Investigating relation between various structural patterns found in real-world networks and stability of underlying systems is crucial to understand importance and evolutionary origin of such patterns. We evolve multiplex networks,…
We consider a network of coupled agents playing the Prisoner's Dilemma game, in which players are allowed to pick a strategy in the interval [0,1], with 0 corresponding to defection, 1 to cooperation, and intermediate values representing…
Modeling complex networks has been the focus of much research for over a decade. Preferential attachment (PA) is considered a common explanation to the self organization of evolving networks, suggesting that new nodes prefer to attach to…
In two-sided matching markets, the agents are partitioned into two sets. Each agent wishes to be matched to an agent in the other set and has a strict preference over these potential matches. A matching is stable if there are no blocking…
From social networks to P2P systems, network sampling arises in many settings. We present a detailed study on the nature of biases in network sampling strategies to shed light on how best to sample from networks. We investigate connections…
Mechanism design on social networks is a hot research direction recently, and we have seen many interesting results in auctions and matching. Compared to the traditional settings, the new goal of the network settings is that we need to…
The stable roommates problem is a non-bipartite version of the stable matching problem in a bipartite graph. In this paper, we consider the stable roommates problem with ties. In particular, we focus on strong stability, which is one of the…
The topologies of predictable dynamic networks are continuously dynamic in terms of node position, network connectivity and link metric. However, their dynamics are almost predictable compared with the ad-hoc network. The existing routing…
In this paper, we consider one-to-one matchings between two disjoint groups of agents. Each agent has a preference over a subset of the agents in the other group, and these preferences may contain ties. Strong stability is one of the…
We study the interaction between network effects and external incentives on file sharing behavior in Peer-to-Peer (P2P) networks. Many current or envisioned P2P networks reward individuals for sharing files, via financial incentives or…
Complex network theory is a useful way to study many real systems. In this paper, an anti-attack model based on complex network theory is introduced. The mechanism of this model is based on dynamic compensation process and reverse…
Community detection is an important tool for analyzing the social graph of mobile phone users. The problem of finding communities in static graphs has been widely studied. However, since mobile social networks evolve over time, static graph…
Networks are important representations in computer science to communicate structural aspects of a given system of interacting components. The evolution of a network has several topological properties that can provide us information on the…
Consider a cyclically ordered collection of $r$ equinumerous agent sets with strict preferences of every agent over the agents from the next agent set. A weakly stable cyclic matching is a partition of the set of agents into disjoint union…
In a many-to-many matching model in which agents' preferences satisfy substitutability and the law of aggregate demand, we present an algorithm to compute the full set of stable matchings. This algorithm relies on the idea of "cycles in…
Networks such as organizational network of a global company play an important role in a variety of knowledge management and information diffusion tasks. The nodes in these networks correspond to individuals who are self-interested. The…