Simultaneous action selection

Rock–paper–scissors

is an example of a game which employs simultaneous action selection.

Simultaneous action selection, or SAS, is a

rock–paper–scissors and Diplomacy. Typically, a "secret yet binding" method of committing to one's move is necessary, so that as players' moves are revealed and implemented, others do not change their moves in light of the new information. Thus, in Diplomacy, players write down their moves and then reveal them simultaneously. Because no player gets the first move, this potentially arbitrary source of advantage is not present. It is also possible for simultaneous movement games to proceed relatively quickly, because players are acting at the same time, rather than waiting for their turn. Simultaneous action selection is easily implemented in card games such as Apples to Apples

in which players simply select cards and throw them face-down into the center.

Limitations

Some games do not lend themselves to simultaneous movement, because one player's move may be prevented by the other player's. For instance, in chess, a move of a bishop takes queen would be incompatible with a simultaneous opposing move of queen takes bishop. By contrast, the simultaneous movement is possible in Junta because each coup phase has a movement stage and a separate combat stage; no units are removed until all have had a chance to move. It has been noted that "a certain amount of reverse psychology and reverse-reverse psychology ensues" as players attempt to calculate the implications of others' potential actions.^[1] Junta also has simultaneous action selection in that players secretly choose their locations at the same time.^[2] This is important in that, for instance, a player plotting an assassination may choose the bank for his or her own location (hoping to quickly deposit the ill-gotten gains) before finding out whether the location of his or her assassination was on the mark.

Real world applications

Simultaneous action selection is used in many real-world applications such as

rock-paper-scissors

is used to decide a matter.

References

^ "Simultaneous Action Selection = Randomness". Gamer's Mind. February 16, 2006.
^ Junta at BoardGameGeek

External links

BoardGameGeek: Games using simultaneous action selection
BoardGameGeek wiki: Simultaneous Action Selection

[1] "Simultaneous Action Selection = Randomness". Gamer's Mind. February 16, 2006.

[2] Junta at BoardGameGeek

[1]

[2]

v t e Topics in game theory
Definitions	Congestion game Cooperative game Determinacy Escalation of commitment Extensive-form game First-player and second-player win Game complexity Graphical game Hierarchy of beliefs Information set Normal-form game Preference Sequential game Simultaneous game Simultaneous action selection Solved game Succinct game
Equilibrium concepts	Bayes correlated equilibrium Bayesian Nash equilibrium Berge equilibrium Core Correlated equilibrium Epsilon-equilibrium Evolutionarily stable strategy Gibbs equilibrium Mertens-stable equilibrium Markov perfect equilibrium Nash equilibrium Pareto efficiency Perfect Bayesian equilibrium Proper equilibrium Quantal response equilibrium Quasi-perfect equilibrium Risk dominance Satisfaction equilibrium Self-confirming equilibrium Sequential equilibrium Shapley value Strong Nash equilibrium Subgame perfection Trembling hand
Strategies	Backward induction Bid shading Collusion Forward induction Grim trigger Markov strategy Dominant strategies Pure strategy Mixed strategy Strategy-stealing argument Tit for tat
Classes of games	Bargaining problem Cheap talk Global game Intransitive game Mean-field game Mechanism design n-player game Perfect information Large Poisson game Potential game Repeated game Screening game Signaling game Stackelberg competition Strictly determined game Stochastic game Symmetric game Zero-sum game
Games	Go Chess Infinite chess Checkers Tic-tac-toe Prisoner's dilemma Gift-exchange game Optional prisoner's dilemma Traveler's dilemma Coordination game Chicken Centipede game Lewis signaling game Volunteer's dilemma Dollar auction Battle of the sexes Stag hunt Matching pennies Ultimatum game Rock paper scissors Pirate game Dictator game Public goods game Blotto game War of attrition El Farol Bar problem Fair division Fair cake-cutting Cournot game Deadlock Diner's dilemma Guess 2/3 of the average Kuhn poker Nash bargaining game Induction puzzles Trust game Princess and monster game Rendezvous problem
Theorems	Arrow's impossibility theorem Aumann's agreement theorem Folk theorem Minimax theorem Nash's theorem Negamax theorem Purification theorem Revelation principle Sprague–Grundy theorem Zermelo's theorem
Key figures	Albert W. Tucker Amos Tversky Antoine Augustin Cournot Ariel Rubinstein Claude Shannon Daniel Kahneman David K. Levine David M. Kreps Donald B. Gillies Drew Fudenberg Eric Maskin Harold W. Kuhn Herbert Simon Hervé Moulin John Conway Jean Tirole Jean-François Mertens Jennifer Tour Chayes John Harsanyi John Maynard Smith John Nash John von Neumann Kenneth Arrow Kenneth Binmore Leonid Hurwicz Lloyd Shapley Melvin Dresher Merrill M. Flood Olga Bondareva Oskar Morgenstern Paul Milgrom Peyton Young Reinhard Selten Robert Axelrod Robert Aumann Robert B. Wilson Roger Myerson Samuel Bowles Suzanne Scotchmer Thomas Schelling William Vickrey
Miscellaneous	All-pay auction Alpha–beta pruning Bertrand paradox Bounded rationality Combinatorial game theory Confrontation analysis Coopetition Evolutionary game theory First-move advantage in chess Glossary of game theory List of game theorists List of games in game theory No-win situation Solving chess Topological game Tragedy of the commons Tyranny of small decisions

Limitations

Real world applications

See also

References

External links