In this paper we demonstrate a new method for computing approximate Nash equilibria in n-person games. Strategy spaces are assumed to be represented by simplices, while payoff functions are assumed to be concave. Our procedure relies on a simplicial algorithm that traces paths through the set of...

We prove the existence of equilibria in games with players who employ abstract (non-binary) choice rules. This framework goes beyond the standard, transitive model and encompasses games where players have non-transitive preferences (e.g., skew-symmetric bilinear preferences).