A Nash type equilibrium in games without transitive preferences (Q1823881)

The authors prove the existence of a Nash type equilibrium for games with an arbitrary set of players having preference correspondences not satisfying any transitivity requirement. Instead, they make convexity assumptions both on the preferences and on the payoff functions. They also relate their results to the question of existence of equilibrium in abstract economies. The spaces of strategies are subsets of locally convex topological linear spaces and the spaces of payoffs are subsets of regular topological spaces. Unfortunately, some of the papers quoted by the authors in the text are not contained in the list of references.