Multiplayer rock-paper-scissors
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.
- An application of Dilworth's lattice of maximal antichains
- Game theory and exercises
- scientific article; zbMATH DE number 1868896 (Why is no real title available?)
- Regular Hypertournaments and Arc-Pancyclicity
- Rock-paper-scissors meets Borromean rings
- The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs
- The greatest common divisor of certain sets of binomial coefficients
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)