English
Related papers

Related papers: Manipulation of k-Coalitional Games on Social Netw…

200 papers

We study payoff manipulation in repeated multi-objective Stackelberg games, where a leader may strategically influence a follower's deterministic best response, e.g., by offering a share of their own payoff. We assume that the follower's…

Computer Science and Game Theory · Computer Science 2025-08-27 Phurinut Srisawad , Juergen Branke , Long Tran-Thanh

Modelling the behaviours of other agents is essential for understanding how agents interact and making effective decisions. Existing methods for agent modelling commonly assume knowledge of the local observations and chosen actions of the…

Machine Learning · Computer Science 2021-11-10 Georgios Papoudakis , Filippos Christianos , Stefano V. Albrecht

Social dilemmas are situations where individuals face a temptation to increase their payoffs at a cost to total welfare. Building artificially intelligent agents that achieve good outcomes in these situations is important because many real…

Artificial Intelligence · Computer Science 2018-03-05 Adam Lerer , Alexander Peysakhovich

We study a family online influence maximization problems where in a sequence of rounds $t=1,\ldots,T$, a decision maker selects one from a large number of agents with the goal of maximizing influence. Upon choosing an agent, the decision…

Machine Learning · Computer Science 2021-09-27 Gábor Lugosi , Gergely Neu , Julia Olkhovskaya

This article evaluates AI-enabled influence operations in synthetic social networks through controlled simulations of narrative release, amplification, and counter-messaging. We measure exposure and belief change in agentic audiences,…

Computers and Society · Computer Science 2026-05-28 Alejandro Buitrago López , David Montoro Aguilera , Javier Pastor-Galindo , José A. Ruipérez-Valiente

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…

Computer Science and Game Theory · Computer Science 2017-09-01 Radhika Arava

We consider the distributed optimization problem for a multi-agent system. Here, multiple agents cooperatively optimize an objective by sharing information through a communication network and performing computations. In this tutorial, we…

Optimization and Control · Mathematics 2023-09-21 Bryan Van Scoy , Laurent Lessard

In many multiagent scenarios, agents distribute resources, such as time or energy, among several tasks. Having completed their tasks and generated profits, task payoffs must be divided among the agents in some reasonable manner. Cooperative…

Computer Science and Game Theory · Computer Science 2014-07-16 Yair Zick , Georgios Chalkiadakis , Edith Elkind , Evangelos Markakis

In many problems, agents cooperate locally so that a leader or fusion center can infer the state of every agent from probing the state of only a small number of agents. Versions of this problem arise when a fusion center reconstructs an…

Multiagent Systems · Computer Science 2017-02-10 Stephen Kruzick , Sérgio Pequito , Soummya Kar , José M. F. Moura , A. Pedro Aguiar

Modern threats have emerged from the prevalence of social networks. Hostile actors, such as extremist groups or foreign governments, utilize these networks to run propaganda campaigns with different aims. For extremists, these campaigns are…

Social and Information Networks · Computer Science 2018-04-10 Fanyu Que , Krishnan Rajagopalan , Tauhid Zaman

The integrity of elections is central to democratic systems. However, a myriad of malicious actors aspire to influence election outcomes for financial or political benefit. A common means to such ends is by manipulating perceptions of the…

Computer Science and Game Theory · Computer Science 2022-06-22 Junlin Wu , Andrew Estornell , Lecheng Kong , Yevgeniy Vorobeychik

We study the fundamental mistake bound and sample complexity in the strategic classification, where agents can strategically manipulate their feature vector up to an extent in order to be predicted as positive. For example, given a…

Machine Learning · Computer Science 2024-01-17 Han Shao , Avrim Blum , Omar Montasser

How does information regarding an adversary's intentions affect optimal system design? This paper addresses this question in the context of graphical coordination games where an adversary can indirectly influence the behavior of agents by…

Computer Science and Game Theory · Computer Science 2020-03-18 Brandon C. Collins , Philip N. Brown

Data collecting agents in large networks, such as the electric power system, need to share information (measurements) for estimating the system state in a distributed manner. However, privacy concerns may limit or prevent this exchange…

Information Theory · Computer Science 2015-10-28 E. Veronica Belmega , Lalitha Sankar , H. Vincent Poor

We revisit the coalition structure generation problem in which the goal is to partition the players into exhaustive and disjoint coalitions so as to maximize the social welfare. One of our key results is a general polynomial-time algorithm…

Computer Science and Game Theory · Computer Science 2011-06-21 Haris Aziz , Bart de Keijzer

Robotic manipulation stands as a largely unsolved problem despite significant advances in robotics and machine learning in the last decades. One of the central challenges of manipulation is partial observability, as the agent usually does…

Robotics · Computer Science 2022-06-22 Tim Schneider , Boris Belousov , Hany Abdulsamad , Jan Peters

We propose a novel network formation game that explains the emergence of various hierarchical structures in groups where self-interested or utility-maximizing individuals decide to establish or severe relationships of authority or…

Computer Science and Game Theory · Computer Science 2021-09-15 Pedro Cisneros-Velarde , Francesco Bullo

Cooperative bargaining games are widely used to model resource allocation and conflict resolution. Traditional solutions assume the mediator can access agents utility function values and gradients. However, there is an increasing number of…

Computer Science and Game Theory · Computer Science 2025-10-20 Kushagra Gupta , Surya Murthy , Mustafa O. Karabag , Ufuk Topcu , David Fridovich-Keil

We consider long-lived agents who interact repeatedly in a social network. In each period, each agent learns about an unknown state by observing a private signal and her neighbors' actions from the previous period before choosing her own…

Theoretical Economics · Economics 2025-08-19 Florian Brandl

It is known that individuals in social networks tend to exhibit homophily (a.k.a. assortative mixing) in their social ties, which implies that they prefer bonding with others of their own kind. But what are the reasons for this phenomenon?…

Social and Information Networks · Computer Science 2017-03-28 Chen Avin , Hadassa Daltrophe , Zvi Lotker , David Peleg
‹ Prev 1 8 9 10 Next ›