Multiplayer rock-paper-scissors (Q783283)

The author studies the so-called selection games which can be considered as a generalization of the well-known rock-paper-scissors game. Such a game can be described as an algebra with one \(n\)-ary operation which is called \(n\)-\(magma\). Conversely, to every \(n\)-magma can be assigned a certain selection game. The author defines for an \(n\)-ary operation to be conservative, essentially polyadic, nondegenerate and strongly fair. An \(n\)-magma whose operation satisfies these conditions is called a PRPS-magma. She shows that these algebras form varieties generated by hypertournament algebras, count these algebras, study their automorphisms, and determine their congruence lattices. Moreover, she produces a family of finite simple algebras of this form.