零行列式策略的设计及其在网络化重复博弈中的应用

Controlling conditional expectations by zero-determinant strategies

Zero-determinant strategies are memory-one strategies in repeated games which unilaterally enforce linear relations between expected payoffs of players. Recently, the concept of zero-determinant strategies was extended to the class of memory-$n$ strategies with $n\geq 1$, which enables more complicated control of payoffs by one player. However, what we can do by memory-$n$ zero-determinant strategies is still not clear. Here, we show that memory-$n$ zero-determinant strategies in repeated games can be used to control conditional expectations of payoffs. Equivalently, they can be used to contro…

在衰减主动探测下揭示网络博弈中的战略互动

Revealing Strategic Interactions in Network Games Under Decaying Active Probing

本文研究了在衰减主动探测下重复线性二次网络博弈中的拓扑恢复问题，提出结构可恢复性条件和衰减探测信号，实现噪声下交互矩阵的精确恢复。

Payoff Control in Repeated Games

Evolutionary game theory is a powerful mathematical framework to study how intelligent individuals adjust their strategies in collective interactions. It has been widely believed that it is impossible to unilaterally control players' payoffs in games, since payoffs are jointly determined by all players. Until recently, a class of so-called zero-determinant strategies are revealed, which enables a player to make a unilateral payoff control over her partners in two-action repeated games with a constant continuation probability. The existing methods, however, lead to the curse of dimensionality w…