Probability and Strategies

Probability and Strategies

Copyright: © 2021 |Pages: 31
DOI: 10.4018/978-1-7998-3871-5.ch007
OnDemand:
(Individual Chapters)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

When you participate in a game, but in general when you compete with one or more opponents, it is essential to define strategic behavior. Because probability often plays a central role, it is important to learn how to profitably manage the information we have. The chapter presents a multiplicity of games, more or less known. The whole allows us to take up some already known concepts and to suggest new ways of deepening them. It should be noted that the center of the analysis is on probability and we do not want to focus only on games of chance, even if they constitute a field historically very studied.
Chapter Preview
Top

Introduction

Always be a little improbable. ~ Oscar Wilde

The concept of strategy, understood as the ability to achieve a given objective by providing the means to do so, is fundamental in all aspects of daily life; all the more so when not all the elements in our possession can be determined with certainty. Numerous experiments have shown that mice also adopt a refined behavioral model based on the calculation of probabilities when it comes to waiting for a reward. The literature on the subject of strategies related to random games is very extensive, for a particular study of Stochastic and Bayesian Games you can refer to the text by Leyton-Brown, & Shoham (2008).

Strategy plays an important role during the games. In a game there are three key concepts:

  • 1.

    the scenario, i.e., the environment in which the game takes place;

  • 2.

    the randomness, which intervenes to a greater or lesser extent in most games;

  • 3.

    the bet, which may be absent or present as in gambling.

Two cases can be distinguished here: Pure strategy completely defines the way a player plays a game, so what choice he will make in each situation he can find; Mixed strategy is a distribution of probability over all the available ones. In practice, a player can choose any pure strategy with 0 ≤ p ≤ 1.

A particular strategic game in its simplicity is skunk, proposed in a didactic key by Dan Brutlag (1994) but originally launched in 1953 by William Herbert Schaper as a board game in a box. The term indicates the animal but, in slang, means to defeat heavily, annihilate the opponent. Before starting the game each competitor has a sheet with five columns on which to write the results (Table 1).

Table 1.
Initial skunk table
SKUNK

The object of the game is to accumulate points by rolling two dice. The points are accumulated by making several throws, but by choosing to stop before the face with the value one comes out on one of the dice (a skunk in the original version). In this situation, the points of the turn are deleted. If a double one is rolled, then all the points accumulated in the previous columns are deleted.

The game itself is not complex, but it can be a starting point to answer some questions that imply a reflection on some not secondary aspects. What are the odds of throwing two dice, subject to certain constraints? Was the winner just lucky? Which strategy should be used in the game?

If we try to analyze the space of events, it is easy to see that the probability of double one is 1/36, that of simple one is 10/36 and that a favorable throw has a probability of 25/36. If we multiply each positive result by the probability of its achievement we see that the average score is 8 (Table 2).

Table 2.
Calculating the average score for the skunk game
123456
1000000
20456780.160.200.240.280.32
30567890.200.240.280.320.36
406789100.240.280.320.360.40
5078910110.280.320.360.400.44
60891011120.320.360.400.440.48
𝚺8

Key Terms in this Chapter

Pure Strategy: A complete definition of how a player will play a game.

Travelling Salesman Problem: The shortest possible route that visits each city and returns to the origin.

Banach Problem: Inspired by a humorous reference to Banach's smoking habit.

Simulated Annealing: A probabilistic technique for approximating the global optimum.

Tit for TAT: A Strategy in game theory.

Mixed Strategy: An assignment of a probability to each pure strategy.

Prisoner’s Dilemma: A classical example of a game analyzed in game theory.

Complete Chapter List

Search this Book:
Reset