Questions tagged [nash-equilibrium]

For questions regarding the Nash equilibrium solution concept in strategic games.

Let $(S,f)$ be a game with $n$ players, where $S_{i}$ is the strategy set for player $i$, $S=S_{1}\times S_{2}\times \ldots \times S_{n}$ is the set of strategy profiles and $f(x)=(f_{1}(x),\dotsc ,f_{n}(x))$ is its payoff function evaluated at $x\in S$.

Let $x_{i}$ be a strategy profile of player $i$,$x_{-i}$ be a strategy profile of all players except for player $i$. When each player $i\in \{1,\dotsc ,n\}$ chooses strategy $x_{i}$ resulting in strategy profile $x=(x_{1},\dotsc ,x_{n})$ then player $i$ obtains payoff $f_{i}(x)$. Note that the payoff depends on the strategy profile chosen, i.e., on the strategy chosen by player $i$ as well as the strategies chosen by all the other players. A strategy profile $x^{*}\in S$ is a Nash equilibrium (NE) if no unilateral deviation in strategy by any single player is profitable for that player, that is

$$\forall i, x_i \in S_i: f_i(x_i^{*}, x_{-i}^{*}) \ge f_i(x_i, x_{-i}^{*}).$$

622 questions
32
votes
3 answers

How to compute ALL Nash equilibria in an example of a 3x3 matrix

I am trying to understand how to compute all Nash equilibria in a 2 player game, but I fail when there are more than 2 possible options to play. Could somebody explain to me how to calculate a matrix like this (without computer) \begin{matrix} …
22
votes
5 answers

best strategies for 'Squid Game' episode 6 game 4 "marble game" players

Two players each get $n=10$ marbles. Every alternating turn, one player (say, the player whose turn it is) hides an amount of own marbles in fist, and, the other player must guess if hidden amount is odd or even, and, that other player (i.e., the…
16
votes
1 answer

Optimal strategy for Jackpot Rock Paper Scissors

Jackpot Rock Paper Scissors is a gambling variant of Rock Paper Scissors, wherein ties result in the wager being carried forward into a jackpot. If a player plays the same hand (rock, paper or scissors) 3 or more consecutive turns and wins on that…
Heptic
  • 317
15
votes
1 answer

Equilibrium existence proof

Problem: Let $J$ be an integer and let $I$ be an integer multiple of $J$. Let ${\cal I}= \lbrace 1,2,\ldots, I\rbrace$ and ${\cal J}= \lbrace 1,2,\ldots, J\rbrace$. The set $X_{I,J}$ of all $\frac{I}{J}$-subsets of $\cal I$ contains exactly…
Shane
  • 1,325
14
votes
4 answers

Splitting the dollar Nash equilibrium

I'm working on a game theory problem I can't seem to figure out. Players 1 and 2 are bargaining over how to split $\$10$. Each player names an amount $s_i$, between 0 and 10 for herself. These numbers do not have to be in whole dollar units. The…
Ray B.
  • 914
13
votes
3 answers

Optimal Strategy for Rock Paper Scissors with different rewards

Imagine Rock Paper Scissors, but where winning with a different hand gives a different reward. If you win with Rock, you get \$9. Your opponent loses the \$9. If you win with Paper, you get \$3. Your opponent loses the \$3. If you win with…
Heptic
  • 317
12
votes
1 answer

Squid Game Theory: Rock-Paper-Scissors Minus One

In the first episode of Squid Game Season 2, two characters play Rock-Paper-Scissors Minus One against each other. Here, each player chooses rock, paper or scissors with each of their left and right hands (possibly the same for each hand, possibly…
12
votes
2 answers

Finding mixed Nash equilibria in continuous games

I'm taking my first (graduate-level) game theory class. I understand how to find Nash equilibria in simple games, such as those given in finite tables, and can see (usually) how to find the mixed equilibria in those cases. However, most of our…
Hanmyo
  • 322
11
votes
1 answer

Blotto game variation

My smart friend ZWX challenged me to solve the "brainteaser" below, but to my surprise, the problem seems highly nontrivial as I took a closer look. Anyway, the question goes: In a game, both you and your opponent have $100$ units of resources to…
11
votes
2 answers

Nash equilibrium in first price auction

I'm trying to understand Exercise 18.2 from Martin J. Osborne and Ariel Rubinstein A Course in Game Theory about finding pure Nash equilibria in a first-price auction. There are $n$ players, named $\{1,2,\dots,n\}$ participating in a sealed-bid…
10
votes
3 answers

Is there experimental evidence that people ever play mixed Nash equilibrium in real games?

Have any studies been done that demonstrate people (not game theorists) actually using mixed Nash equilibrium as their strategy in a game?
logicbird
  • 255
10
votes
2 answers

What is the Nash Equilibrium of the Monty Hall Problem?

The Monty Hall problem or paradox is famous and well-studied. But what confused me about the description was an unstated assumption. Suppose you're on a game show, and you're given the choice of three doors: behind one door is a car; behind the…
8
votes
6 answers

Can Nash Equilibrium be more than two?

In the Prisoner's Dilemma example, we know that there is only one Nash Equilibrium. That is both of them confess. Is it possible that there are two Nash equilibriums in one example? Can you roughly give me such an example?
sleeve chen
  • 8,576
8
votes
1 answer

Compute mixed Nash equilibria when objects are to be won by bidding

Consider a complete information game being played between two players given five objects. Players have certain preferences over the objects and each simultaneously places a sealed bid-vector to win them. For each object, the highest bidder wins it…
8
votes
1 answer

Mixed Strategy Nash Equilibrium of Rock Paper Scissors with 3 players?

It seems like most game theory tutorials focus on 2-player games and often algorithms for finding Nash equilibria break down with 3+ players. So here is a simple question: Is $(\frac{1}{3},\frac{1}{3},\frac{1}{3})$ the only Nash equilibrium in a…
1
2 3
41 42