Related papers: Selfish peering and routing in the Internet
Due to the lack of coordination, it is unlikely that the selfish players of a strategic game reach a socially good state. A possible way to cope with selfishness is to compute a desired outcome (if it is tractable) and impose it. However…
We study the self-assembly of a complex network of collaborations among self-interested agents. The agents can maintain different levels of cooperation with different partners. Further, they continuously, selectively, and independently…
To maintain fairness, in the terms of resources shared by an individual peer, a proper incentive policy is required in a peer to peer network. This letter proposes, a simpler mechanism to rank the peers based on their resource contributions…
Several autonomous energy management and peer-to-peer trading mechanisms for future energy markets have been recently proposed based on optimization and game theory. In this paper, we study the impact of trading prices on the outcome of…
In this part of the paper, we obtain analytical results for the case that transport costs are not small (complement of Part I), and combine them with the results in Part I of the paper to provide general results for all values of transport…
When trying to maximize the adoption of a behavior in a population connected by a social network, it is common to strategize about where in the network to seed the behavior, often with an element of randomness. Selecting seeds uniformly at…
Stochastic matching is the stochastic version of the well-known matching problem, which consists in maximizing the rewards of a matching under a set of probability distributions associated with the nodes and edges. In most stochastic…
In multi-hop ad hoc networks, selfish nodes may unduly acquire high quality of service (QoS) by assigning higher priority to source packets and lower priority to transit packets. Such traffic remapping attacks (TRAs) are cheap to launch,…
Stochastic service systems describe situations in which customers compete for service from scarce resources. Think of check-in lines at airports, waiting rooms in hospitals or queues in supermarkets, where the scarce resource is human…
Unlike commercial ridesharing, non-commercial peer-to-peer (P2P) ridesharing has been subject to limited research -- although it can promote viable solutions in non-urban communities. This paper focuses on the core problem in P2P…
Selfish Network Creation focuses on modeling real world networks from a game-theoretic point of view. One of the classic models by Fabrikant et al. [PODC'03] is the network creation game, where agents correspond to nodes in a network which…
Many real-world networks such as social networks consist of strategic agents. The topology of these networks often plays a crucial role in determining the ease and speed with which certain information driven tasks can be accomplished.…
We study the competition for partners in two-sided matching markets with heterogeneous agent preferences, with a focus on how the equilibrium outcomes depend on the connectivity in the market. We model random partially connected markets,…
This paper aims to provide insight into stability of collaboration choices in P2P networks. We study networks where exchanges between nodes are driven by the desire to receive the best service available. This is the case for most existing…
Network optimization has generally been focused on solving network flow problems, but recently there have been investigations into optimizing network characteristics. Optimizing network connectivity to maximize the number of nodes within a…
People choose friendships with people similar to themselves, i.e. they sort by resemblence. Economic studies have shown when sorting is optimal and constitute an equilibrium, however, this presumes lack of beneficial spillovers. We…
We study a routing game in an environment with multiple heterogeneous information systems and an uncertain state that affects edge costs of a congested network. Each information system sends a noisy signal about the state to its subscribed…
This paper develops strategic foundations for an important statistical model of random networks with heterogeneous expected degrees. Based on this, we show how social networking services that subtly alter the costs and indirect benefits of…
We investigate packet routing games in which network users selfishly route themselves through a network over discrete time, aiming to reach the destination as quickly as possible. Conflicts due to limited capacities are resolved by the…
Coevolution between strategy and network structure is established as a means to arrive at optimal conditions for resolving social dilemmas. Yet recent research highlights that the interdependence between networks may be just as important as…