Game Theory is the Cheat Code to Life

Source: Game Theory is the Cheat Code to Life, Blank Rascal, 16:14, uploaded 2025-05-05, playlist index 265.

Blank Rascal opens by treating life as a game that runs until death. A life is a string of situations, some long and consequential, others brief and forgettable. Each situation has choices, and the speaker imagines that most of them have an objectively correct strategy. The familiar regret comes afterwards, when a person realises that one different word, bet or decision might have changed what followed. Game theory offers a way to calculate those choices, although the video spends more time testing the limits of that idea than celebrating it.

The one-shot prisoner’s dilemma

The first example is Golden Balls, a British game show in which two contestants secretly choose between splitting a jackpot and stealing it. If both choose split, they share the money. If one steals, that player takes everything. If both steal, both receive nothing. The players can bargain and lie before the choice, yet the final decision remains simultaneous and private.

This is the prisoner’s dilemma. Assuming both players act rationally, stealing dominates. It can produce a win against split or a draw against steal, whilst splitting can produce a draw or a loss. The trouble arrives when both players follow that reasoning. They both steal and leave with nothing. The video calls this a Nash equilibrium, a position in which neither player can improve the result by changing their choice alone. The most desirable result is mutual cooperation, yet the individually rational move leads away from it.

The television show makes the model less clean. People can speak before choosing, and their promises, threats, guilt and charm become part of the game. The video reports an analysis of 289 episodes in which contestants chose split around 53 per cent of the time and steal around 47 per cent of the time. From the perspective of the one-shot mathematical model, most contestants then behave irrationally. Blank Rascal’s first piece of advice is deliberately ugly: when the situation really is a one-off prisoner’s dilemma, defect, betray and take the mathematically safer outcome.

Payoffs, hostages and the missing variables

The speaker turns the same logic into a kidnapping scenario. A ransom has been paid, and the kidnapper must choose between releasing the hostage and killing them. The hostage knows the kidnapper’s identity, so release carries a chance of arrest. Killing removes that risk and leaves the kidnapper with the money, although it destroys the preferred outcome of remaining a non-murderer and keeping an admired person alive.

The numerical payoff table makes the answer look simple. If imprisonment carries a meaningful probability, killing the hostage gives the higher calculated return. The video pushes this conclusion into absurdity, then admits that the situation contains variables the table did not include. Stockholm syndrome might make the hostage stay silent. A future technology involving “mind potatoes” might force them to testify. The probability of each outcome changes when trust, attachment, fear and new information enter the game. The base calculation still favours killing within the fictional model, whilst the joke exposes how quickly a tidy payoff table becomes inadequate for a human situation. The warning to avoid kidnapping is unusually clear.

Conventions that make ordinary life possible

A coin toss looks like a clean 50/50 game until the speaker asks what people choose before the coin lands. He says that people tend to call heads because it comes first, so heads receives a slight preference. A player who knows that convention can guess heads more often and gain an advantage in a game that appears evenly balanced.

Conventions reduce uncertainty because people expect others to follow them. Driving depends on using the agreed side of the road. Tipping gives a waiter a reason to expect future payment and provide service. A handshake carries no useful physical information, yet it signals a shared social rule. Paying taxes keeps a government funded because most people accept the convention at the same time. Money has value because people collectively treat the paper, numbers and entries in an account as value.

The money example opens one of the video’s short doomsday rants. If everyone abandons the convention at once, the social system around it fails. Blank Rascal imagines the collapse, nuclear fire and climate disaster, then apologises for drifting away from the topic. The joke still makes the point: society contains games whose rules work because enough players continue to believe that the rules apply.

Randomness, poker and the limits of calculation

The next game is a duel. Two rivals walk towards each other with one bullet each and can fire at any point. Firing early risks a miss and waiting risks being shot first. If the players have equal accuracy and follow the same assumptions, there is no best moment. The game has a mixed-strategy equilibrium, so a random shot gives the player the same expected position as any other timing choice.

Poker uses the same logic. A player who raises only with good cards becomes easy to read, whilst a player who raises every time soon loses their money. Occasional bluffs make the strategy harder to assess because the opponent cannot know whether a raise reflects a strong hand or a calculated deviation. The distinction between a deliberate mistake and a free gift is part of good play.

Blank Rascal then gives intuition a higher place than formal strategy. Reading a person’s habits, body language and emotions can reveal information that a numerical model cannot represent well. Human emotion changes the payoffs, and the people inside the game can learn that the model exists. At this point, the speaker says, game theory often falls apart.

Ultimatum and the price of spite

The Ultimatum Game makes the failure of perfect rationality plain. One player divides 100 coins between the two players. The second player can accept the split, in which case both receive their shares, or reject it, in which case both receive nothing. A strict game-theory answer gives the first player 99 coins and the second player 1, because one coin is better than zero.

People often reject that offer because the one coin feels insulting. The first player therefore has to account for spite and the desire to punish an unfair division. A 50/50 offer is likely to be accepted. A 55/45 split may still pass as cheeky. A 90/10 split makes rejection much more likely, even though rejection leaves the second player with nothing. The further the offer moves from a fair division, the more strongly the second player can choose revenge over income.

Repetition changes the calculation. If the same players meet again, a rejection teaches the first player to move closer to an even split. The second player can still refuse an offer, yet both players have an incentive to find an arrangement that survives another round. Game theory becomes more useful when it includes learning, memory and future consequences.

Axelrod’s repeated games

The repeated version of Golden Balls changes the prisoner’s dilemma as well. Stealing remains the safest move in a single round. Across many rounds, cooperation can earn more. Robert Axelrod of the University of Michigan tested this through contests in which people submitted computer programs to play repeated prisoner’s dilemmas against each other for 200 rounds.

The entries included friendly, aggressive, sneaky and random programmes. The video says that the nicer programmes performed better on average because they could cooperate with other cooperative programmes. Aggressive programmes often entered cycles of mutual defection. A cooperative programme could lose against an aggressor, yet still score more across the whole field because most of its interactions remained productive.

The winner in both contests was tit for tat. It begins by cooperating. After the other programme defects, it defects in the next round. It then copies the other programme’s previous move: continued defection receives continued defection, whilst a return to cooperation receives the same in return.

Axelrod attributes its performance to four properties. Tit for tat is nice because it never starts the fight. It retaliates when another player defects. It forgives after one round, which lets cooperation resume when the other player changes course. Its rule is clear, so the opponent can understand the cause of each response. The video turns this into a rough social ethic. An eye for an eye performs better in the repeated game than turning the other cheek, provided that the punishment remains limited and cooperation can return.

The hand you are dealt

The title’s cheat code is therefore a mixture of behaviours. Start cooperatively, answer betrayal, forgive a change of behaviour, and keep the reason for each response legible. Cut losses when a game has turned bad. Accept a sacrifice when it protects a better repeated outcome. Add some randomness so that other players cannot read the whole strategy from one move.

The conclusion also withdraws the promise of a universal method. Intelligence, charisma, money and physical inheritance affect the game before a person makes a choice. Those advantages arrive as luck, and each person has to play with the hand they receive. Life remains unfair, with or without a dealer. Blank Rascal’s final embrace is comic, yet the qualification is serious enough: game theory can describe incentives inside a situation, while it cannot decide who receives the situation in the first place.

Limits

The description calls the video entertainment rather than a lecture, and the narration supplies no bibliography or links for its figures. The reports about 289 Golden Balls episodes, the 53/47 split, the coin-calling bias and Axelrod’s tournaments belong to the source’s account here. The video names John Nash and Robert Axelrod, but it does not identify the papers, datasets or exact tournament records behind those claims.

The models also depend on conditions that ordinary life keeps disturbing. A prisoner’s dilemma assumes identifiable choices and payoffs. A mixed strategy assumes that the relevant probabilities remain stable. Repeated games assume that players meet again and recognise each other’s actions. The video itself supplies the counterweight: emotion, spite, trust, convention, intuition and unequal starting conditions change the game before the calculation can finish.

Further reading / references

• John Nash is named in the explanation of Nash equilibrium.
• Robert Axelrod’s University of Michigan tournaments are named as the source for the discussion of repeated prisoner’s dilemmas and tit for tat.
• Golden Balls and the Ultimatum Game provide the video’s main worked examples. The video gives no external links or full bibliographic references for either one.