Related papers: Inefficient Alliance Formation in Coalitional Blot…
Cooperative game theory has diverse applications in contemporary artificial intelligence, including domains like interpretable machine learning, resource allocation, and collaborative decision-making. However, specifying a cooperative game…
We investigate a routing game that allows for the creation of coalitions, within the framework of cooperative game theory. Specifically, we describe the cost of each coalition as its maximin value. This represents the performance that the…
We introduce and study a model of an interacting population of agents who collaborate in groups which compete for limited resources. Groups are formed by random matching agents and their worth is determined by the sum of the efforts…
Congestion games are popular models often used to study the system-level inefficiencies caused by selfish agents, typically measured by the price of anarchy. One may expect that aligning the agents' preferences with the system-level…
In a combinatorial exchange setting, players place sell (resp. buy) bids on combinations of traded goods. Besides the question of finding an optimal selection of winning bids, the question of how to share the obtained profit is of high…
When group members claim a portion of limited resources, it is tempting to invest more effort to get a larger share. However, if everyone acts similarly, they all get the same piece they would obtain without extra effort. This is the…
Federated learning promises significant sample-efficiency gains by pooling data across multiple agents, yet incentive misalignment is an obstacle: each update is costly to the contributor but boosts every participant. We introduce a…
Concurrent games with a fixed number of agents have been thoroughly studied, with various solution concepts and objectives for the agents. In this paper, we consider concurrent games with an arbitrary number of agents, and study the problem…
We study the emergence of altruistic behaviour in collective games. In particular, we take into account Toral's version of collective Parrondo's paradoxical games, in which the redistribution of capital between agents, who can play…
Leaving the joint enterprise when defection is unveiled is always a viable option to avoid being exploited. Although loner strategy helps the population not to be trapped into the tragedy of the commons state, it could offer only a modest…
Federated learning is a setting where agents, each with access to their own data source, combine models from local data to create a global model. If agents are drawing their data from different distributions, though, federated learning…
The basic social dilemma is frequently captured by a public goods game where participants decide simultaneously whether to support a common pool or not and after the enhanced contributions are distributed uniformly among all competitors.…
Similar to what happens between humans in the real world, in open multi-agent systems distributed over the Internet, such as online social networks or wiki technologies, agents often form coalitions by agreeing to act as a whole in order to…
In multiplayer games with sequential decision-making, self-interested players form dynamic coalitions to achieve most-preferred temporal goals beyond their individual capabilities. We introduce a novel procedure to synthesize strategies…
In a multi-battle contest, each time a player competes by investing some of her budgets or resources in a component battle to collect a value if winning the battle. There are multiple battles to fight, and the budgets get consumed over…
We initiate the study of the natural multiplayer generalization of the classic continuous Colonel Blotto game. The two-player Blotto game, introduced by Borel as a model of resource competition across $n$ simultaneous fronts, has been…
The formal study of coalition formation in multi-agent systems is typically realized in the framework of hedonic games, which originate from economic theory. The main focus of this branch of research has been on the existence and the…
Knockout tournaments, also known as single-elimination or cup tournaments, are a popular form of sports competitions. In the standard probabilistic setting, for each pairing of players, one of the players wins the game with a certain (a…
We consider a cooperative game defined by an economic lot-sizing problem with heterogeneous costs over a finite time horizon, in which each firm faces demand for a single product in each period and coalitions can pool orders. The model of…
Applications, such as military and disaster response, can benefit from robotic collectives' ability to perform multiple cooperative tasks (e.g., surveillance, damage assessments) efficiently across a large spatial area. Coalition formation…