Divide the dollar is a simplified version of a two player bargaining problem game devised by John Nash. The generalized divide the dollar game has 𝑛2 players. Evolutionary algorithms can be used to evolve individual players for this generalized game but representation-i.e., a genome plus a...

In hedonic games, coalitions are created as a result of the strategic interaction of independent players. In particular, in additively separable hedonic games, every player has valuations for all other ones, and the utility for belonging to a coalition is given by the sum of the valuations for...

We study a non-cooperative game with aggregative structure, namely when the payoffs depend on the strategies of the opponent players through an aggregator function. We assume that a subset of players behave as leaders in a Stackelberg model. The leaders, as well the followers, act...

This paper generalises the Hawk-Dove evolutionary game by introducing cost sharing ratios for both players, and applies the generalised Hawk-Dove model to conflict management in projects through investigating the stability of Nash equilibria. A model with clashing interests between a project...

Algorithms for equilibrium computation generally make no attempt to ensure that the computed strategies are understandable by humans. For instance the strategies for the strongest poker agents are represented as massive binary files. In many situations, we would like to compute strategies that...

In this paper, we consider a novel game theory model for the competitive influence maximization problem. We model this problem as a simultaneous non-cooperative game with complete information and rational players, where there are at least two players who are supposed to be out of the network and...

Network games (NGs) are played on directed graphs and are extensively used in network design and analysis. Search problems for NGs include finding special strategy profiles such as a Nash equilibrium and a globally-optimal solution. The networks modeled by NGs may be huge. In formal...

We consider non-zero sum bi-matrix games where one player presumes the role of a leader in the Stackelberg model, while the other player is her follower. We show that the leader can improve her reward if she can incentivise her follower by paying some of her own utility to the follower for...

A simple expression is derived for the optimal strategy in the minimum effort game. This maps from player beliefs to an optimal effort level. From this expression the set of Nash equilibria in the game is fully characterized. All Nash equilibria are symmetric and involve at most two actions...

The evolution of social or biological species can be modeled as an evolutionary game with the equilibrium strategies of the game as prediction for the ultimate distributions of species in population, when some species may survive with positive proportions, while others become extinct. We say a...