Designing Frugal Best-Response Mechanisms for Social Network Coordination Games
نویسندگان
چکیده
Social coordination games have recently received a lot of attention since they model several kinds of interaction problems in social networks. However, the performance of these games at equilibrium may be very bad. This motivates the adoption of mechanisms for inducing a socially optimal state. In this work we consider the design of incentive-compatible best-response mechanisms (Nisan, Schapira, Valiant, Zohar, 2011) for social coordination games. Specifically, we would like to compute special fees that may be assigned to players in order to induce the optimum profile of a social coordination game. Moreover, we would like the mechanism to be frugal, that is it can be implemented without any cost. We show that a frugal incentive-compatible best-response mechanism for inducing the optimal profile of a two-strategy social coordination game always exists. Moreover, for such a mechanism, we investigate other properties inspired by envy-freeness, collusion-resistance and fairness. Finally, we show that extensions of the above results to other classes of games or to non-optimal profiles may be hard.
منابع مشابه
Coordination Mechanisms, Cost-Sharing, and Approximation Algorithms for Scheduling
We reveal a connection between coordination mechanisms for unrelated machine scheduling and cost-sharing protocols. Using this connection, we interpret three coordination mechanisms from the recent literature as Shapley-value-based cost-sharing protocols, thus providing a unifying justification regarding why these mechanisms induce potential games. More importantly, this connection provides a t...
متن کاملStochastically stable equilibria in n-person binary coordination games
Best response structure of n-person binary coordination games suggests that equilibrium selection outcome is determined by the balance of the ordinal aspects and the cardinal aspects of the game. This intuition inspires new equilibrium selection results for that class of games under the adaptive play with mistakes. Detailed comparison of the adaptive play and the single population random matchi...
متن کاملRobustness in Discrete Preference Games
In a discrete preference game, each agent is equipped with an internal belief and declares her preference from a discrete set of alternatives. The payoff of an agent depends on whether the declared preference agrees with the belief of the agent and on the coordination with the preferences declared by the neighbors of the agent in the underlying social network. These games have been used to mode...
متن کاملEvolutionary network games: equilibria from imitation and best-response dynamics
We consider games of strategic substitutes and strategic complements on networks. We introduce two different evolutionary dynamics in order to refine their multiplicity of equilibria, and we analyse the system through a mean field approach. We find that for the best-shot game, taken as a model for substitutes, a replicator-like dynamics does not lead to Nash equilibria, whereas it leads to uniq...
متن کاملSocial Network Analysis Using Coordination Games
Communities typically capture homophily as people of the same community share many common features. This paper is motivated by the problem of community detection in social networks, as it can help improve our understanding of the network topology and the spread of information. Given the selfish nature of humans to align with like-minded people, we employ game theoretic models and algorithms to ...
متن کامل