Related papers: Quantum Strategies Win in a Defector-Dominated Pop…
As artificial intelligence continues to drive innovation in complex, decentralized environments, the need for scalable, adaptive, and privacy-preserving decision-making systems has become critical. This paper introduces a novel framework…
We consider a network of coupled agents playing the Prisoner's Dilemma game, in which players are allowed to pick a strategy in the interval [0,1], with 0 corresponding to defection, 1 to cooperation, and intermediate values representing…
The quantum internet is a rapidly developing technological reality, yet, it remains unclear what kind of quantum network structures might emerge. Since indirect quantum communication is already feasible and preserves absolute security of…
Whether a population of decision-making individuals will reach a state of satisfactory decisions is a fundamental problem in studying collective behaviors. In the framework of evolutionary game theory and by means of potential functions,…
Competing strategies in an evolutionary game model, or species in a biosystem, can easily form a larger unit which protects them from the invasion of an external actor. Such a defensive alliance may have two, three, four or even more…
We investigate the spatial distribution and the global frequency of agents who can either cooperate or defect. The agent interaction is described by a deterministic, non-iterated prisoner's dilemma game, further each agent only locally…
We consider the dating market decision problem under the quantum mechanics point of view. Quantum states whose associated amplitudes are modified by men strategies are used to represent women. Grover quantum search algorithm is used as a…
We integrate dual-process theories of human cognition with evolutionary game theory to study the evolution of automatic and controlled decision-making processes. We introduce a model where agents who make decisions using either automatic or…
Central to the success of adaptive systems is their ability to interpret signals from their environment and respond accordingly -- they act as agents interacting with their surroundings. Such agents typically perform better when able to…
We study the evolution of cooperation in the spatial prisoner's dilemma game, where besides unconditional cooperation and defection, tit-for-tat, win-stay-lose-shift and extortion are the five competing strategies. While pairwise imitation…
An evolutionary prisoner's dilemma (PD) game is studied with players located on a hierarchical structure of layered square lattices. The players can follow two strategies [D (defector) and C (cooperator)] and their income comes from PD…
Many mathematical frameworks of evolutionary game dynamics assume that the total population size is constant and that selection affects only the relative frequency of strategies. Here, we consider evolutionary game dynamics in an extended…
We model a system of networking agents that seek to optimize their centrality in the network while keeping their cost, the number of connections they are participating in, low. Unlike other game-theory based models for network evolution,…
In this paper we present results and analyses of a class of games in which heterogeneous agents are rewarded for being in a minority group. Each agent possesses a number of fixed strategies each of which are predictors of the next minority…
Emerging applications in engineering such as crowd-sourcing and (mis)information propagation involve a large population of heterogeneous users or agents in a complex network who strategically make dynamic decisions. In this work, we…
Situations of conflict giving rise to social dilemmas are widespread in society and game theory is one major way in which they can be investigated. Starting from the observation that individuals in society interact through networks of…
We revisit two evolutionary game theory models, namely the Prisoner and the Snowdrift dilemmas, on top of small-world networks. These dynamics on networked populations (individuals occupying nodes of a graph) are mainly concerning on the…
We investigate how much quantum distributed algorithms can outperform classical distributed algorithms with respect to the message complexity (the overall amount of communication used by the algorithm). Recently, Dufoulon, Magniez and…
Agent-based simulations are essential for studying cooperation on spatial networks. However, finite-size effects -- random fluctuations due to limited network sizes -- can cause certain strategies to unexpectedly dominate or disappear,…
Evolutionary prisoner's dilemma games are studied with players located on square lattice and random regular graphs defining four neighbors for each one. The players follow one of the three strategies: tit-for-tat, unconditional cooperation,…