Multiplayer rock-paper-scissors

From MaRDI portal



Abstract: We study a class of algebras we regard as generalized Rock-Paper-Scissors games. We determine when such algebras can exist, show that these algebras generate the varieties generated by hypertournament algebras, count these algebras, study their automorphisms, and determine their congruence lattices. We produce a family of finite simple algebras.


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.





Describes a project that uses

Uses Software






This page was built for publication: Multiplayer rock-paper-scissors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q783283)