We propose a novel game-theoretic multi-agent system approach to create a desired 2D pattern. We interpret a pattern formation problem as a variant of the iterated Spatial Prisoner’s Dilemma game, where evolutionary competing CA-based agents are ...

Analyzing and predicting the dynamics of opinion formation in the context of social environments are problems that attracted much attention in literature. While grounded in social psychology, these problems are nowadays popular within the ...

The landscape of human interaction has undergone a profound transformation since the advent of Online Social Networks (OSNs). Not only are they changing interpersonal dynamics, but they are also redefining the way businesses, political figures, and ...

In this work, we introduce a game-theoretic model that assesses the cyber-security risk of cloud networks and informs security experts on the optimal security strategies. Our approach combines game theory, combinatorial optimization, and cyber-...

We study the Spohn conditional independence (CI) variety C X of an n-player game X for undirected graphical models on n binary random variables consisting of one edge. For a generic game, we show that C X is a smooth irreducible complete ...

This article continues the investigation started in [18] on the role of possibilistic mixed strategies in strategic-form games. In this earlier work we assumed, as standard in possibility theory, that joint possibility distributions were computed ...

In resource contribution games, a class of non-cooperative games, the players want to obtain a bundle of resources and are endowed with bags of bundles of resources that they can make available into a common for all to enjoy. Available resources ...

Schelling's famous model of segregation assumes agents of different types, who would like to be located in neighborhoods having at least a certain fraction of agents of the same type. We consider natural generalizations that allow for ...

System optimum (SO) routing, wherein the total travel time of all users is minimized, is a holy grail for transportation authorities. However, SO routing may discriminate against users who incur much larger travel times than others to achieve high ...$$$\mathrm{}$$$

We consider the operation of debt transfer in interbank networks. In particular, assuming a financial system that is represented by a network of banks and their bilateral debt contracts, we consider the setting where a bank can transfer the right to ...

A classic model to study strategic decision making in multi-agent systems is the normal-form game. This model can be generalised to allow for an infinite number of pure strategies leading to continuous games. Multi-objective normal-form games are another ...

Motivated by possible applications in fault-tolerant selfish routing, we introduce the notion of uniform mixed equilibrium in network congestion games with adversarial link failures, where agents need to route traffic from a source to a destination node. ...

In Mean Field Games of Controls, the dynamics of the single agent is influenced not only by the distribution of the agents, as in the classical theory, but also by the distribution of their optimal strategies. In this paper, we study quasi-...

In this paper we study the existence and uniqueness of Nash equilibria (solution to competition-wise problems, with several controls trying to reach possibly different goals) associated to linear partial differential equations and show that, in ...

We consider the Chainmail Jousting game by Gygax and Perren (1971), a symmetric game of pure skill for two players. Preliminary analysis produces a payoff matrix with only zero and unit values. We find that this matrix is too large to be solved by ...

Deep reinforcement learning (DRL) has recently been employed in various games, with which superhuman intelligence has been achieved, including Atari, Go, no-limit, and Texas hold’em. However, this technique has not been fully considered for ...

Tournament solutions provide methods of selecting winners of a competition based on the results of pairwise comparisons. These methods have been studied in-depth from the perspective of social choice theory, where a comparison between two ...

Decision trees and random forests are some of the most popular machine learning tools for binary classification, being used in many practical applications. Both methods provide a neighborhood for tested data during the prediction phase, and ...

The Colonel Blotto game and its variants are a common approach to study competitive allocation of interchangeable resources (e.g., soldiers, money, or votes). We introduce a new variant of Blotto, which we call the Derby game, to study competitive ...

Technological developments play a crucial role in allowing governments and industries to meet carbon emission targets, whilst maintaining cost effectiveness. Mathematical modeling related to climate change has often included technology (including ...