Exploiting Graph Properties for Decentralized Reputation Systems

In online communities, users frequently interact with strangers in order to buy and sell products, watch videos, educating themselves, and playing games. Establishing trust among strangers is essential for the functionality of these communities but challenging, as well. Online reputation systems effectively establish trust among strangers by...

Robustness and Optimization of Complex Networks: Reconstructability, Algorithms and Modeling

The infrastructure networks, including the Internet, telecommunication networks, electrical power grids, transportation networks (road, railway, waterway, and airway networks), gas networks and water networks, are becoming more and more complex. The complex infrastructure networks are crucial to our human society, and it has been a hot research ...

A Social Network Model Exhibiting Tunable Overlapping Community Structure

Social networks, as well as many other real-world networks, exhibit overlapping community structure. In this paper, we present formulas which facilitate the computation for characterizing the overlapping community structure of networks. A hypergraph representation of networks with overlapping community structure is introduced. Using the...

Multiagent task allocation in social networks

This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. We show that the complexity of this problem remains NP-complete. Moreover, it is not approximable within some factor. In contrast to this, we develop an efficient greedy...

Mechanisms for Self-organizing Ad Hoc Grids

Resources contributed in ad hoc grids are volatile, unreliable and non-dedicated. Furthermore, resource owners contribute resources according to their own use and access policies. This phenomenon necessitates the study of the mechanisms that enable the ad hoc grid to modify its infrastructure in an autonomous way according to varying resource...

ELASTICITY: Topological Characterization of Robustness in Complex Networks

Distributed Task Allocation in Social Networks

This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. We show that the complexity of this problem remains NPhard. Moreover, it is not approximable within some factor. We develop an algorithm based on the contract-net...

Crawling and Detecting Community Structure in Online Social Networks using Local Information

As Online Social Networks (OSNs) become an intensive sub- ject of research for example in computer science, networking, social sci- ences etc., a growing need for valid and useful datasets is present. The time taken to crawl the network is however introducing a bias which should be minimized. Usual ways of addressing this problem are sampling...