Related papers: Group Activity Selection on Social Networks
In this second part of our work, we study the steady state of the population and the social utility for the three dynamics SSD, NBRD and NRPM; which were introduced in the first part. We provide sufficient conditions on the network based on…
We consider snap-stabilizing algorithms in anonymous networks. Self-stabilizing algorithms are well known fault tolerant algorithms : a self-stabilizing algorithm will eventually recover from arbitrary transient faults. On the other hand,…
Transmission of disease, spread of information and rumors, adoption of new products, and many other network phenomena can be fruitfully modeled as cascading processes, where actions chosen by nodes influence the subsequent behavior of…
The main problem we address in this paper is whether function determines form when a society of agents organizes itself for some purpose or whether the organizing method is more important than the functionality in determining the structure…
The decision making and management of many engineering networks involves multiple parties with conflicting interests, while each party is constituted with multiple agents. Such problems can be casted as a multi-cluster game. Each cluster is…
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interactions among existing members are likely to occur in the near…
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…
We study online adaptive policy selection in systems with time-varying costs and dynamics. We develop the Gradient-based Adaptive Policy Selection (GAPS) algorithm together with a general analytical framework for online policy selection via…
We analyze the accuracy of collective decision-making in socially connected populations, where agents update binary choices through local interactions on a network. Each agent receives a private signal that is biased -- even marginally --…
In this work we compare social clusters with spin clusters and compare different properties. We also try to compare phase changes in market and labor stratification with phase changes of spin clusters. Then we compare the requisites for…
We propose a simple model for a binary decision making process on a graph, motivated by modeling social decision making with cooperative individuals. The model is similar to a random field Ising model or fiber bundle model, but with key…
This paper considers the problem of Nash equilibrium (NE) seeking in aggregative games, where the payoff function of each player depends on an aggregate of all players' actions. We present a distributed continuous time algorithm such that…
A class of dynamic threshold models is proposed, for describing the upset of collective actions in social networks. The agents of the network have to decide whether to undertake a certain action or not. They make their decision by comparing…
Stackability for finitely presented groups consists of a dynamical system that iteratively moves paths into a maximal tree in the Cayley graph. Combining with formal language theoretic restrictions yields auto- or algorithmic stackability,…
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism design is the art of designing the rules of the game so that…
Congestion games are a classical type of games studied in game theory, in which n players choose a resource, and their individual cost increases with the number of other players choosing the same resource. In network congestion games…
We consider a class of targeted intervention problems in dynamic network and graphon games. First, we study a general dynamic network game in which players interact over a graph and maximize their heterogeneous, concave goal functionals,…
Networks capture our intuition about relationships in the world. They describe the friendships between Facebook users, interactions in financial markets, and synapses connecting neurons in the brain. These networks are richly structured…
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism design is the art of designing the rules of the game so that…
In this work and the supporting Parts II [2] and III [3], we provide a rather detailed analysis of the stability and performance of asynchronous strategies for solving distributed optimization and adaptation problems over networks. We…