Can I afford to remember less than you? Best responses in repeated additive games
研究两人重复加性博弈中，若一方策略依赖对手最近n步行动，则另一方存在仅依赖自己最近n-1步行动的最优反应，表明玩家可用更少记忆获得最大收益。
In this paper, we study best responses in repeated additive games among two players. A stage game is additive if each player’s payoff is the sum of two components, and each component only depends on the action of a single player. We suppose one player’s strategy depends on the co-player’s last n actions. Then we prove that the other player has a best response that only depends on their own n − 1 actions. That is, for an important sub-class of games and strategies, players can achieve maximum payoffs even with less memory than their opponent. • We study repeated additive games among two players with finite memory (finite recall). • Suppose one player reacts to the opponent’s actions during the last n rounds. • We prove the opponent has a best response that only depends on the last n-1 rounds.