Appendix of the paper Exploiting Opponents under Utility Constraints in Sequential Games

Appendix A provides the proofs omitted from Section 4.1, describing the method adopted Appendix B provides the proofs omitted from Section 4.2, describing the method adopted Appendix D provides some additional experimental results. A Proofs omitted from Section 4.1 B Proofs omitted from Section 4.2 Theorem 2. Let t [T ] and δ (0, 1). The proof follows the reasoning outlined in Section 4.2. Before proving Theorem 3, we need to show the following technical lemma. Lemma 4. Let f (τ):= This is reasonable in practice, since a new player can always be profiled according to a number of user classes.