One-shot game

A one-shot game is a single round in Game Theory where players choose at the same time without knowing the other players’ choices. Because there is no second round, strategy focuses on immediate payoff and best responses.

What is one-shot game?

A one-shot game in Game Theory is a single strategic interaction that happens once, with players choosing at the same time and without knowing what the others picked. Since there is no later round to build trust, punish cheating, or reward cooperation, each player has to act based on expectations about the other side.

That timing matters. If you know the game is only happening once, you usually cannot rely on long-term relationships to shape behavior. Instead, you think about what choice gives you the best result right now, given what you think the other player is likely to do.

A simple way to picture it is a one-time negotiation, a single auction, or a classic prisoner's dilemma setup. Each person is making a decision under uncertainty, and the outcome depends on how the choices fit together. That is why one-shot games are often used to model situations where people cannot coordinate ahead of time or where the interaction ends before reputation matters.

In these games, the payoff matrix is the main tool for mapping out outcomes. It lays out what each player gets for each combination of choices, which makes it easier to compare strategies. From there, you look for the best response, meaning the choice that does best against the other player's possible action.

Nash equilibrium shows up a lot in one-shot games because it identifies a stable outcome where no player can improve by changing their own move alone. In some games, that equilibrium gives a result that is individually rational but not collectively ideal, which is exactly why one-shot games are so useful in Game Theory. They show how rational choices can still produce tension, conflict, or missed cooperation when there is only one round and no future consequences.

A common misconception is that one-shot means "simple" or "random." It does not. The game may have only one round, but the strategy can still be rich because each player is reasoning about beliefs, incentives, and the other player's possible best response. One-shot games are often the cleanest starting point for analyzing strategic behavior before moving into repeated games, where the possibility of future rounds changes everything.

Why one-shot game matters in Game Theory

One-shot games matter because they are the baseline for thinking about strategy when future interaction is off the table. If you can explain what happens in a one-time encounter, you have a strong starting point for comparing it with repeated games, where cooperation, trust, and punishment can change the outcome.

This concept also makes Nash equilibrium and dominant strategy easier to read in context. In a one-shot setting, a dominant strategy can stand out because the player is not trying to preserve a relationship or influence tomorrow's round. Even when no dominant strategy exists, the logic of best responses still tells you how players reason through the payoff matrix.

The prisoner's dilemma is the classic example, but the idea reaches beyond that. Any situation where people act once, without communication and without a future reward structure, can behave like a one-shot game. That makes the term useful for analyzing economic choices, bargaining problems, voting interactions, and other strategic situations where the immediate payoff dominates the decision.

How one-shot game connects across the course

Nash Equilibrium

A one-shot game is often analyzed by checking whether the outcome is a Nash equilibrium. If each player's choice is already the best response to the other's choice, then neither player wants to change unilaterally. That makes equilibrium the main way to tell whether the one-round outcome is stable, even if it is not the best joint result.

Dominant Strategy

Dominant strategy reasoning is especially clear in one-shot games because there is no future round to change incentives. If one action gives a player a better payoff no matter what the other player does, that strategy will usually be very attractive in a single encounter. Many one-shot examples are built to show how dominant strategies can lead to predictable but not always cooperative outcomes.

Payoff Matrix

The payoff matrix is the chart you use to map out a one-shot game. It lists each combination of choices and shows what each player gets, so you can compare outcomes without guessing. In a single-round setting, the matrix makes it easier to spot best responses, mutual gains, and the choices that lead to conflict.

Iterated Prisoner's Dilemma

The iterated prisoner's dilemma is the repeated version of the classic one-shot prisoner's dilemma. Comparing the two shows how adding future rounds can change behavior, because players may cooperate now to protect later payoffs. This contrast is one of the cleanest ways to see why one-shot games and repeated games do not follow the same logic.

Is one-shot game on the Game Theory exam?

A problem set question may give you a payoff table and ask you to identify the one-shot game outcome, best responses, or Nash equilibrium. The move is to treat the interaction as a single round, ignore reputation effects, and compare payoffs cell by cell. If the question asks how behavior changes when the same game is repeated, you then explain why the one-shot logic no longer captures the whole story. In discussion or short response, you might use a one-shot game to justify why cooperation fails when there is no future punishment or reward. In class, that often means reading a prisoner's dilemma, comparing it with a repeated version, and explaining why the same players may act differently across the two settings.

Key things to remember about one-shot game

• A one-shot game is a single strategic interaction, so players choose once and do not get another round to respond later.

• Because there is no future relationship to protect, the main question is which action gives the best immediate payoff given the other player's likely move.

• One-shot games are usually analyzed with payoff matrices, best responses, and Nash equilibrium.

• The prisoner's dilemma is the classic example, especially when cooperation would be better for both players but individual incentives push them apart.

• One-shot games are the starting point for comparing simple strategic behavior with repeated games, where trust, punishment, and reputation can change decisions.

Frequently asked questions about one-shot game

What is a one-shot game in Game Theory?

A one-shot game is a single round of strategic interaction where players choose at the same time and cannot react after seeing the other player's move. The focus is on immediate payoffs, not on future consequences. That is why one-shot games are often used to model decisions made under uncertainty and without repeated contact.

How is a one-shot game different from a repeated game?

A one-shot game happens once, while a repeated game happens over multiple rounds. That difference changes strategy a lot, because repeated games can support trust, punishment, and cooperation over time. In a one-shot game, players usually think only about the current payoff.

What is an example of a one-shot game?

The prisoner's dilemma is the classic example. Each person has an incentive to choose the self-interested option, even though both would do better if they cooperated. That tension makes it a strong model for one-time strategic decisions.

How do you analyze a one-shot game?

You usually start with the payoff matrix, then compare each player's best responses to the other player's possible choices. From there, you check whether the outcome is a Nash equilibrium and whether any strategy is dominant. The main goal is to see what rational players would do when there is only one round.