Related papers: Cooperation in Threshold Public Projects with Bina…
Distributed optimization and Nash equilibrium (NE) seeking problems have drawn much attention in the control community recently. This paper studies a class of non-cooperative games, known as N-cluster game, which subsumes both cooperative…
Objective: The study investigates the effect on cooperation in multiplayer games, when the population from which all individuals are drawn is structured - i.e. when a given individual is only competing with a small subset of the entire…
Nash equilibrium serves as a fundamental mathematical tool in economics and game theory. However, it classically assumes knowledge of player utilities, whereas economics generally regards preferences as more fundamental. To leverage…
The decisions that human beings make to allocate time has significant bearing on economic output and to the sustenance of social networks. The time allocation problem motivates our formal analysis of the resource allocation game, where…
The evolution of cooperation has been a perennial problem for evolutionary biology because cooperation is undermined by selfish cheaters (or "free riders") that profit from cooperators but do not invest any resources themselves. In a purely…
We consider an agent community wishing to decide on several binary issues by means of issue-by-issue majority voting. For each issue and each agent, one of the two options is better than the other. However, some of the agents may be…
Cooperatively planning for multiple agents has been proposed as a promising method for strategic and motion planning for automated vehicles. By taking into account the intent of every agent, the ego agent can incorporate future interactions…
This paper studies cooperative games where coalitions are formed online and the value generated by the grand coalition must be irrevocably distributed among the players at each timestep. We investigate the fundamental issue of strategic…
Due to the lack of coordination, it is unlikely that the selfish players of a strategic game reach a socially good state. A possible way to cope with selfishness is to compute a desired outcome (if it is tractable) and impose it. However…
A stylized experiment, the public goods game, has taught us the peculiar reproducible fact that humans tend to contribute more to shared resources than expected from economically rational assumptions. There have been two competing…
We study binary-action pairwise-separable network games that encompass both coordinating and anti-coordinating behaviors. Our model is grounded in an underlying directed signed graph, where each link is associated with a weight that…
The paper studies the routing in the network shared by several users. Each user seeks to optimize either its own performance or some combination between its own performance and that of other users, by controlling the routing of its given…
The problem of free-riding arises when individuals benefit from a shared resource, service, or public good without contributing proportionately to its provision. This conduct often leads to a collective action problem, as individuals pursue…
This paper considers a non-cooperative game in which competing users sharing a frequency-selective interference channel selfishly optimize their power allocation in order to improve their achievable rates. Previously, it was shown that a…
The evolution of cooperation among unrelated individuals in human and animal societies remains a challenging issue across disciplines. It is an important subject also in the evolutionary game theory to understand how cooperation arises. The…
Global cooperation often falters despite shared objectives, as misaligned interests and unequal incentives undermine collective efforts, such as those in international climate change collaborations. To tackle this issue, this paper…
This study investigates the effect of behavioral mistakes on the evolutionary stability of the cooperative equilibrium in a repeated public goods game. Many studies show that behavioral mistakes have detrimental effects on cooperation…
Two-player complete-information game trees are perhaps the simplest possible setting for studying general-sum games and the computational problem of finding equilibria. These games admit a simple bottom-up algorithm for finding subgame…
In this paper, we study the distributed generalized Nash equilibrium seeking problem of non-cooperative games in dynamic environments. Each player in the game aims to minimize its own time-varying cost function subject to a local action…
We study contests in which two groups compete to win (or not to win) a group-specific public-good/bad prize. Each player in the groups can exert two types of effort: one to help her own group win the prize, and one to sabotage her own…