相关论文: The Geometry of Zero-Determinant Strategies

We consider both finite-state game graphs and recursive game graphs (or pushdown game graphs), that can model the control flow of sequential programs with recursion, with multi-dimensional mean-payoff objectives. In pushdown games two types…

We analyze, both analytically and numerically, the self-organization of a system of "selfish" adaptive agents playing an arbitrary iterated pairwise game (defined by a 2X2 payoff matrix). Examples of possible games to play are: the…

We studied the effect of three strategy updating rules in coevolving prisoner's dilemma games where agents (nodes) can switch both the strategy and social partners. Under two node-based strategy updating rules, strategy updating occurs…

Since the introduction of zero-determinant strategies, extortionate strategies have received considerable interest. While an interesting class of strategies, the definitions of extortionate strategies are algebraically rigid, apply only to…

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…

The notions of symmetry and anonymity in strategic games have been formalized in different ways in the literature. We propose a combinatorial framework to analyze these notions, using group actions. Then, the same framework is used to…

We study turn-based quantitative games of infinite duration opposing two antagonistic players and played over graphs. This model is widely accepted as providing the adequate framework for formalizing the synthesis question for reactive…

Effective communication is an important skill for enabling information exchange in multi-agent settings and emergent communication is now a vibrant field of research, with common settings involving discrete cheap-talk channels. Since, by…

Various social dilemma games that follow different strategy updating rules have been studied on many networks.The reported results span the entire spectrum, from significantly boosting,to marginally affecting,to seriously decreasing the…

The self-organization in cooperative regimes in a simple mean-field version of a model based on "selfish" agents which play the Prisoner's Dilemma (PD) game is studied. The agents have no memory and use strategies not based on direct…

A simple model for cooperation between "selfish" agents, which play an extended version of the Prisoner's Dilemma(PD) game, in which they use arbitrary payoffs, is presented and studied. A continuous variable, representing the probability…

Replicator dynamics have been widely used in evolutionary game theory to model how strategy frequencies evolve over time in large populations. The so-called payoff matrix encodes the pairwise fitness that each strategy obtains when…

A central challenge in game theory and learning systems such as GANs is understanding which algorithms can efficiently compute equilibria across the heterogeneous landscape of games. Equilibrium computation is typically studied solver by…

We study strategic games on weighted directed graphs, in which the payoff of a player is defined as the sum of the weights on the edges from players who chose the same strategy, augmented by a fixed non-negative integer bonus for picking a…

In social dilemmas, most interactions are transient and susceptible to restructuring, leading to continuous changes in social networks over time. Typically, agents assess the rewards of their current interactions and adjust their…

Strategic uncertainty complicates policy design in coordination games. To rein in strategic uncertainty, the Planner in this paper connects the problem of policy design to that of equilibrium selection. We characterize the subsidy scheme…

This paper is concerned with the death-birth updating process. This model is an example of a spatial game in which players located on the~$d$-dimensional integer lattice are characterized by one of two possible strategies and update their…

We have studied an evolutionary game with spatially arranged players who can choose one of the two strategies (named cooperation and defection for social dilemmas) when playing with their neighbors. In addition to the application of the…

Synthesizing near-optimal mixed strategies for zero-sum differential games (ZSDGs) has been a longstanding challenge. Existing research mainly focuses on characterizing the theoretical value function, while the practical design of…

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,…