Several important directions remain for future work. In this paper we focused our evaluation of greedy weights on strategic-form games. While we evaluated greedy weights on normal-form subgames of the sequential game Diplomacy,
a natural question is whether similar results can be obtained for general sequential games that cannot be modeled as a sequence of normal-form games by extending greedy weights to counterfactual regret minimization [1]}. We show some preliminary positive results in the Appendix
for the sequential games of Kuhn and Leduc poker but describe several difficult remaining challenges in scaling to large sequential games, which we believe to be worthy of future investigation.
