Related papers: Emergent Collaboration in Social Purpose Games

Efficient allocation and use of limited resources are fundamental to advancing collective welfare and achieving long-term societal sustainability. This challenge involves not only how policymakers distribute scarce resources among…

We consider the provision of public goods on networks of strategic agents. We study different effort outcomes of these network games, namely, the Nash equilibria, Pareto efficient effort profiles, and semi-cooperative equilibria (effort…

Mean field games (MFG) and mean field control (MFC) problems have been introduced to study large populations of strategic players. They correspond respectively to non-cooperative or cooperative scenarios, where the aim is to find the Nash…

One of the natural objectives of the field of the social networks is to predict agents' behaviour. To better understand the spread of various products through a social network arXiv:1105.2434 introduced a threshold model, in which the nodes…

We introduce a new measure of the discrepancy in strategic games between the social welfare in a Nash equilibrium and in a social optimum, that we call selfishness level. It is the smallest fraction of the social welfare that needs to be…

We study network games in which players choose both the partners with whom they associate and an action level (e.g., effort) that creates spillovers for those partners. We introduce a framework and two solution concepts, extending standard…

Interactions among selfish users sharing a common transmission channel can be modeled as a non-cooperative game using the game theory framework. When selfish users choose their transmission probabilities independently without any…

Coordination games have been of interest to game theorists, economists, and ecologists for many years to study such problems as the emergence of local conventions and the evolution of cooperative behavior. Approaches for understanding the…

This paper introduces a unified framework called cooperative extensive form games, which (i) generalizes standard non-cooperative games, and (ii) allows for more complex coalition formation dynamics than previous concepts like…

In this paper, Nash equilibrium seeking among a network of players is considered. Different from many existing works on Nash equilibrium seeking in non-cooperative games, the players considered in this paper cannot directly observe the…

In a multi-objective game, each individual's payoff is a \emph{vector-valued} function of everyone's actions. Under such vectorial payoffs, Pareto-efficiency is used to formulate each individual's best-response condition, inducing…

Distributed Nash equilibrium (NE) seeking problem for multi-coalition games has attracted increasing attention in recent years, but the research mainly focuses on the case without agreement demand within coalitions. This paper considers a…

We study strategic games on weighted directed graphs, where the payoff of a player is defined as the sum of the weights on the edges from players who chose the same strategy augmented by a fixed non-negative bonus for picking a given…

When can cooperation arise from self-interested decisions in public goods games? And how can we help agents to act cooperatively? We examine these classical questions in a pivotal participation game, a variant of public good games, where…

We introduce a novel class of Nash equilibrium seeking dynamics for non-cooperative games with a finite number of players, where the convergence to the Nash equilibrium is bounded by a KL function with a settling time that can be upper…

This paper investigates the evolution of strategic play where players drawn from a finite well-mixed population are offered the opportunity to play in a public goods game. All players accept the offer. However, due to the possibility of…

We study the evolution of cooperation in public goods games on the square lattice, focusing on the effects that are brought about by different sizes of groups where individuals collect their payoffs and search for potential strategy donors.…

An important task in the analysis of multiagent systems is to understand how groups of selfish players can form coalitions, i.e., work together in teams. In this paper, we study the dynamics of coalition formation under bounded rationality.…

In a network game, players interact over a network and the utility of each player depends on his own action and on an aggregate of his neighbours' actions. Many real world networks of interest are asymmetric and involve a large number of…

In this paper we consider strategic cost sharing games with so-called arbitrary sharing based on various combinatorial optimization problems, such as vertex and set cover, facility location, and network design problems. We concentrate on…