Network Engineering Using Autonomous Agents Increases Cooperation in Human Groups

Simple autonomous agents can enhance creative semantic discovery by human groups

Innovation is challenging, and theory and experiments indicate that groups may be better able to identify and preserve innovations than individuals. But innovation within groups faces its own challenges, including groupthink and truncated diffusion. We performed experiments involving a game in which people search for ideas in various conditions: alone, in networked social groups, or in networked groups featuring autonomous agents (bots). The objective was to search a semantic space of 20,000 nouns with defined similarities for an arbitrary noun with the highest point value. Participants (N = 1875) were embedded in networks (n = 125) of 15 nodes to which we sometimes added 2 bots. The bots had 3 possible strategies: they shared a random noun generated by their immediate neighbors, or a noun most similar from among those identified, or a noun least similar. We first confirm that groups are better able to explore a semantic space than isolated individuals. Then we show that when bots that share the most similar noun operate in groups facing a semantic space that is relatively easy to navigate, group performance is superior. Simple autonomous agents with interpretable behavior can affect the capacity for creative discovery of human groups.

Enhancing social cohesion with cooperative bots in societies of greedy, mobile individuals

Addressing collective issues in social development requires a high level of social cohesion, characterized by cooperation and close social connections. However, social cohesion is challenged by selfish, greedy individuals. With the advancement of artificial intelligence (AI), the dynamics of human-machine hybrid interactions introduce new complexities in fostering social cohesion. This study explores the impact of simple bots on social cohesion from the perspective of human-machine hybrid populations within network. By investigating collective self-organizing movement during migration, results indicate that cooperative bots can promote cooperation, facilitate individual aggregation, and thereby enhance social cohesion. The random exploration movement of bots can break the frozen state of greedy population, help to separate defectors in cooperative clusters, and promote the establishment of cooperative clusters. However, the presence of defective bots can weaken social cohesion, underscoring the importance of carefully designing bot behavior. Our research reveals the potential of bots in guiding social self-organization and provides insights for enhancing social cohesion in the era of human-machine interaction within social networks.

Emergence and collapse of reciprocity in semiautomatic driving coordination experiments with humans

Forms of both simple and complex machine intelligence are increasingly acting within human groups in order to affect collective outcomes. Considering the nature of collective action problems, however, such involvement could paradoxically and unintentionally suppress existing beneficial social norms in humans, such as those involving cooperation. Here, we test theoretical predictions about such an effect using a unique cyber-physical lab experiment where online participants (N = 300 in 150 dyads) drive robotic vehicles remotely in a coordination game. We show that autobraking assistance increases human altruism, such as giving way to others, and that communication helps people to make mutual concessions. On the other hand, autosteering assistance completely inhibits the emergence of reciprocity between people in favor of self-interest maximization. The negative social repercussions persist even after the assistance system is deactivated. Furthermore, adding communication capabilities does not relieve this inhibition of reciprocity because people rarely communicate in the presence of autosteering assistance. Our findings suggest that active safety assistance (a form of simple AI support) can alter the dynamics of social coordination between people, including by affecting the trade-off between individual safety and social reciprocity. The difference between autobraking and autosteering assistance appears to relate to whether the assistive technology supports or replaces human agency in social coordination dilemmas. Humans have developed norms of reciprocity to address collective challenges, but such tacit understandings could break down in situations where machine intelligence is involved in human decision-making without having any normative commitments.

Facilitating cooperation in human-agent hybrid populations through autonomous agents

Cooperative AI has shown its effectiveness in solving the conundrum of cooperation. Understanding how cooperation emerges in human-agent hybrid populations is a topic of significant interest, particularly in the realm of evolutionary game theory. In this article, we scrutinize how cooperative and defective Autonomous Agents (AAs) influence human cooperation in social dilemma games with a one-shot setting. Focusing on well-mixed populations, we find that cooperative AAs have a limited impact in the prisoner's dilemma games but facilitate cooperation in the stag hunt games. Surprisingly, defective AAs can promote complete dominance of cooperation in the snowdrift games. As the proportion of AAs increases, both cooperative and defective AAs have the potential to cause human cooperation to disappear. We then extend our investigation to consider the pairwise comparison rule and complex networks, elucidating that imitation strength and population structure are critical for the emergence of human cooperation in human-agent hybrid populations.

Incentivizing free riders improves collective intelligence in social dilemmas

Collective intelligence challenges are often entangled with collective action problems. For example, voting, rating, and social innovation are collective intelligence tasks that require costly individual contributions. As a result, members of a group often free ride on the information contributed by intrinsically motivated people. Are intrinsically motivated agents the best participants in collective decisions? We embedded a collective intelligence task in a large-scale, virtual world public good game and found that participants who joined the information system but were reluctant to contribute to the public good (free riders) provided more accurate evaluations, whereas participants who rated frequently underperformed. Testing the underlying mechanism revealed that a negative rating bias in free riders is associated with higher accuracy. Importantly, incentivizing evaluations amplifies the relative influence of participants who tend to free ride without altering the (higher) quality of their evaluations, thereby improving collective intelligence. These results suggest that many of the currently available information systems, which strongly select for intrinsically motivated participants, underperform and that collective intelligence can benefit from incentivizing free riding members to engage. More generally, enhancing the diversity of contributor motivations can improve collective intelligence in settings that are entangled with collective action problems.

Stingy bots can improve human welfare in experimental sharing networks

Machines powered by artificial intelligence increasingly permeate social networks with control over resources. However, machine allocation behavior might offer little benefit to human welfare over networks when it ignores the specific network mechanism of social exchange. Here, we perform an online experiment involving simple networks of humans (496 participants in 120 networks) playing a resource-sharing game to which we sometimes add artificial agents (bots). The experiment examines two opposite policies of machine allocation behavior: reciprocal bots, which share all resources reciprocally; and stingy bots, which share no resources at all. We also manipulate the bot's network position. We show that reciprocal bots make little changes in unequal resource distribution among people. On the other hand, stingy bots balance structural power and improve collective welfare in human groups when placed in a specific network position, although they bestow no wealth on people. Our findings highlight the need to incorporate the human nature of reciprocity and relational interdependence in designing machine behavior in sharing networks. Conscientious machines do not always work for human welfare, depending on the network structure where they interact.

Scaffolding cooperation in human groups with deep reinforcement learning

Effective approaches to encouraging group cooperation are still an open challenge. Here we apply recent advances in deep learning to structure networks of human participants playing a group cooperation game. We leverage deep reinforcement learning and simulation methods to train a 'social planner' capable of making recommendations to create or break connections between group members. The strategy that it develops succeeds at encouraging pro-sociality in networks of human participants (N = 208 participants in 13 groups) playing for real monetary stakes. Under the social planner, groups finished the game with an average cooperation rate of 77.7%, compared with 42.8% in static networks (N = 176 in 11 groups). In contrast to prior strategies that separate defectors from cooperators (tested here with N = 384 in 24 groups), the social planner learns to take a conciliatory approach to defectors, encouraging them to act pro-socially by moving them to small highly cooperative neighbourhoods.

Small bots, big impact: solving the conundrum of cooperation in optional Prisoner's Dilemma game through simple strategies

Cooperation plays a crucial role in both nature and human society, and the conundrum of cooperation attracts the attention from interdisciplinary research. In this study, we investigated the evolution of cooperation in optional Prisoner's Dilemma games by introducing simple bots. We focused on one-shot and anonymous games, where the bots could be programmed to always cooperate, always defect, never participate or choose each action with equal probability. Our results show that cooperative bots facilitate the emergence of cooperation among ordinary players in both well-mixed populations and a regular lattice under weak imitation scenarios. Introducing loner bots has no impact on the emergence of cooperation in well-mixed populations, but it facilitates the dominance of cooperation in regular lattices under strong imitation scenarios. However, too many loner bots on a regular lattice inhibit the spread of cooperation and can eventually result in a breakdown of cooperation. Our findings emphasize the significance of bot design in promoting cooperation and offer useful insights for encouraging cooperation in real-world scenarios.

Cooperation without punishment

A fundamental question in social and biological sciences is whether self-governance is possible when individual and collective interests are in conflict. Free riding poses a major challenge to self-governance, and a prominent solution to this challenge has been altruistic punishment. However, this solution is ineffective when counter-punishments are possible and when social interactions are noisy. We set out to address these shortcomings, motivated by the fact that most people behave like conditional cooperators-individuals willing to cooperate if a critical number of others do so. In our evolutionary model, the population contains heterogeneous conditional cooperators whose decisions depend on past cooperation levels. The population plays a repeated public goods game in a moderately noisy environment where individuals can occasionally commit mistakes in their cooperative decisions and in their imitation of the role models' strategies. We show that, under moderate levels of noise, injecting a few altruists into the population triggers positive reciprocity among conditional cooperators, thereby providing a novel mechanism to establish stable cooperation. More broadly, our findings indicate that self-governance is possible while avoiding the detrimental effects of punishment, and suggest that society should focus on creating a critical amount of trust to harness the conditional nature of its members.

Individual and collective learning in groups facing danger

While social networks jeopardize people’s well-being by working as diffusion pathways of falsehood, they may also help people overcome the challenge of misinformation with time and experience. Here I examine how social networks provide learning facilitation using an experiment involving an iterated decision-making game simulating an unpredictable situation faced by a group (2786 subjects in 120 groups). This study shows that, while social networks initially spread false information and suppress necessary actions, with tie rewiring, on the other hand, they facilitate improvement in people's decision-making across time. It also shows that the network's learning facilitation results from the integration of individual experiences into structural changes. In sum, social networks can support collective learning when they are built through people's experiences and accumulated relationships.

The dual problems of coordination and anti-coordination on random bipartite graphs

In some scenarios ("anti-coordination games"), individuals are better off choosing different actions than their neighbors while in other scenarios ("coordination games"), it is beneficial for individuals to choose the same strategy as their neighbors. Despite having different incentives and resulting population dynamics, it is largely unknown which collective outcome, anti-coordination or coordination, is easier to achieve. To address this issue, we focus on the distributed graph coloring problem on bipartite graphs. We show that with only two strategies, anti-coordination games (2-colorings) and coordination games (uniform colorings) are dual problems that are equally difficult to solve. To prove this, we construct an isomorphism between the Markov chains arising from the corresponding anti-coordination and coordination games under certain specific individual stochastic decision-making rules. Our results provide novel insights into solving collective action problems on networks.

Combination of institutional incentives for cooperative governance of risky commons

Finding appropriate incentives to enforce collaborative efforts for governing the commons in risky situations is a long-lasting challenge. Previous works have demonstrated that both punishing free-riders and rewarding cooperators could be potential tools to reach this goal. Despite weak theoretical foundations, policy makers frequently impose a punishment-reward combination. Here, we consider the emergence of positive and negative incentives and analyze their simultaneous impact on sustaining risky commons. Importantly, we consider institutions with fixed and flexible incentives. We find that a local sanctioning scheme with pure reward is the optimal incentive strategy. It can drive the entire population toward a highly cooperative state in a broad range of parameters, independently of the type of institutions. We show that our finding is also valid for flexible incentives in the global sanctioning scheme, although the local arrangement works more effectively.

•

Pure reward in a local scheme is more effective both for fixed and flexible incentives

•

It can drive the entire population toward a highly cooperative state

•

Increasing the efficiency of the institution can induce the success of pure reward

•

A local scheme promotes group success more effectively than a global scheme

Algorithm exploitation: Humans are keen to exploit benevolent AI

We cooperate with other people despite the risk of being exploited or hurt. If future artificial intelligence (AI) systems are benevolent and cooperative toward us, what will we do in return? Here we show that our cooperative dispositions are weaker when we interact with AI. In nine experiments, humans interacted with either another human or an AI agent in four classic social dilemma economic games and a newly designed game of Reciprocity that we introduce here. Contrary to the hypothesis that people mistrust algorithms, participants trusted their AI partners to be as cooperative as humans. However, they did not return AI's benevolence as much and exploited the AI more than humans. These findings warn that future self-driving cars or co-working robots, whose success depends on humans' returning their cooperativeness, run the risk of being exploited. This vulnerability calls not just for smarter machines but also better human-centered policies.

•

People predict that AI agents will be as benevolent (cooperative) as humans

•

People cooperate less with benevolent AI agents than with benevolent humans

•

Reduced cooperation only occurs if it serves people's selfish interests

•

People feel guilty when they exploit humans but not when they exploit AI agents

Random choices facilitate solutions to collective network coloring problems by artificial agents

Global coordination is required to solve a wide variety of challenging collective action problems from network colorings to the tragedy of the commons. Recent empirical study shows that the presence of a few noisy autonomous agents can greatly improve collective performance of humans in solving networked color coordination games. To provide analytical insights into the role of behavioral randomness, here we study myopic artificial agents attempting to solve similar network coloring problems using decision update rules that are only based on local information but allow random choices at various stages of their heuristic reasonings. We show that the resulting efficacy of resolving color conflicts is dependent on the implementation of random behavior of agents and specific population characteristics. Our work demonstrates that distributed greedy optimization algorithms exploiting local information should be deployed in combination with occasional exploration via random choices in order to overcome local minima and achieve global coordination.

•

Local information makes solving distributed network coloring problems difficult

•

Greedy agents can become gridlocked, making it difficult to find a global solution

•

Agents making random choices can facilitate the finding of a global coloring

•

Randomness can be finely tuned to a specific underlying population structure