Strictly competitive games with infinitely many strategies

Abstract

Strictly competitive games are characterized by the fact that every pair of strategies is Pareto optimal in two-players games. We provide a characterization of strictly competitive games when the sets of strategies are not finite. The finite strategy case was settled by Adler, Daskalakis and Papadimitriou who fully proved a conjecture of Aumann.