Manipulation of k-Coalitional Games on Social Networks
Naftali Waxman, Noam Hazon, Sarit Kraus

TL;DR
This paper investigates how manipulative agents can influence coalition formation in social networks, analyzing the impact of different information and connection-manipulation abilities on the susceptibility to manipulation for various social welfare objectives.
Contribution
It provides a comprehensive analysis of manipulation possibilities in k-coalitional games, highlighting conditions under which manipulation is impossible or feasible based on the manipulator's information and actions.
Findings
Limited information restricts manipulation in most cases.
Adding connections alone does not enable manipulation with full information.
Hiding connections makes all objectives vulnerable to manipulation.
Abstract
In many coalition formation games the utility of the agents depends on a social network. In such scenarios there might be a manipulative agent that would like to manipulate his connections in the social network in order to increase his utility. We study a model of coalition formation in which a central organizer, who needs to form coalitions, obtains information about the social network from the agents. The central organizer has her own objective: she might want to maximize the utilitarian social welfare, maximize the egalitarian social welfare, or simply guarantee that every agent will have at least one connection within her coalition. In this paper we study the susceptibility to manipulation of these objectives, given the abilities and information that the manipulator has. Specifically, we show that if the manipulator has very limited information, namely he is only familiar with…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
