Growing cybersecurity risks in the power grid require that utilities implement a variety of
security mechanisms (SMs), including VPNs, firewalls, authentication, and access control …

Motivated by applications in web caches and content delivery in peer-to-peer networks, we
consider the non-metric data placement problem and develop distributed algorithms for …

Caching networks can reduce the routing costs of accessing contents by caching contents
closer to users. However, cache nodes may belong to different entities and behave selfishly …

A resource allocation game with identical preferences is considered where each player, as a
node of an undirected unweighted network, tries to minimize his or her cost by caching an …

We consider the capacitated selfish replication (CSR) game with binary preferences, over
general undirected networks. We study the price of anarchy of such games, and show that it …

Caching networks can reduce the routing costs of accessing contents by caching contents
closer to users. However, cache nodes may belong to different entities and behave selfishly …

Motivated by emerging resource allocation and data placement problems such as web
caches and peer-to-peer systems, we consider and study a class of resource allocation …

We consider the non-metric data placement problem and develop distributed algorithms for
computing or approximating its optimal integral solution. We first show that the non-metric …

We consider in this paper a simple model for human interactions as service providers of
different resources over social networks, and study the dynamics of selfish behavior of such …

In this paper, we consider a resource allocation game with binary preferences and limited
capacities over large scale networks and propose a novel randomized algorithm for …