Skip to main content

Questions tagged [game-theory]

The study of competitive and non-competitive games, equilibrium concepts such as Nash equilibrium, and related subjects. Combinatorial games such as Nim are under [tag:combinatorial-game-theory], and algorithmic aspects (e.g. auctions) are under [tag:algorithmic-game-theory].

4 votes
1 answer
152 views

Let us recall that a poset game is a two–player game in which the players take turns choosing elements of a poset $(P,\leq_P)$ and removing that element together with all elements above it. Although ...
Yester's user avatar
  • 462
4 votes
1 answer
75 views

You have $a$ amber, $b$ bronze, and $c$ crimson colored marbles in your hand, with $a\geq b\geq c$. An exact copy of this set of marbles is in a bag. Every turn, you select a marble from your hand to ...
CosmicOscillator's user avatar
0 votes
1 answer
54 views

SO the problem definition is: Have X clients talking to a single API and that API has some upper bound, N, on the number of requests it will handle before it shapes i.e. the traffic and takes ten ...
CpILL's user avatar
  • 109
5 votes
0 answers
136 views

I stumbled across an answer about The envelope paradox which states that: Let Player 1 write two different numbers on two slips of paper. Then player 2 draws one of the two slips each with probability ...
math_survivor's user avatar
2 votes
1 answer
225 views

In the game "Tug of Luck" $n$ coins are tossed. Player A gets the tails and B gets the heads. Thereafter they take turns rolling a die until one player has gotten rid of all their coins and ...
Rüdi Jehn's user avatar
0 votes
1 answer
87 views

We are given two matrices $R^{N \times N}$, each containing unique integers from $0$ to $N^2 - 1$ (except $0$, it does not need to be unique). The $0$ in the matrices will be called $blank$. The task ...
RodrigerScroge's user avatar
1 vote
1 answer
155 views

Let's consider a two-player finite strategic form game. Suppose $A$ is the payoff matrix for the row player playing mixed strategy $x$, $B$ is the payoff matrix for the column player playing mixed ...
Your neighbor Todorovich's user avatar
5 votes
1 answer
108 views

Let $N \in \mathbb{N}$. We successively construct permutations $$A=(A_1, \dots, A_N), B = (B_1, \dots, B_N) \quad \in \text{Sym}(\{1, \dots, N\}).$$ At each time step $ 1 \leq n \leq N$, We know $\{...
Alex's user avatar
  • 715
4 votes
1 answer
104 views

For a positive integer n, a row of n cards is laid out, each showing a random positive integer. A legal move is to remove either the leftmost or rightmost card. Two players, A and B, take turns, with ...
John O'neil's user avatar
  • 1,063
1 vote
1 answer
99 views

In typical Sprague-Grundy, the person making the last move wins (the node with nimber 0 is losing). If we made it so the person who made the last move is losing - like in Misere Nim - what would be ...
timg's user avatar
  • 113
-1 votes
1 answer
73 views

I have come across this problem which was apparently very famous some years ago, in which a person is placed in front of 3 doors: one of them has a stack of gold behind it, and the other two have ...
Lagrangiano's user avatar
3 votes
2 answers
132 views

Suppose we have $8\times8$ grid numbered from $1$ to $64$ starting with top left corner and placing numbers to the right,then going to the second row and so on.In how many ways can you divide the grid ...
Mateusz's user avatar
  • 89
3 votes
0 answers
95 views

Imagine $n$ players play the following game. Each player simultaneously picks a point inside the unit square $[0,1]^2$. The payoff for each player is the minimum distance from their point to a point ...
Erich Friedman's user avatar
-1 votes
1 answer
55 views

I've heard about infinite player games in a book I'm reading and also there's a heading in the zbmath classification scheme about them. I'm not talking about infinite games, i.e, games that never end. ...
Adrian Arnaez Sanchez's user avatar
12 votes
2 answers
563 views

Question: Players $A$ and $B$ each play a die-rolling game. They have one $10$-sided fair die in front of them labelled $\displaystyle\{0, 1, 2, 3, 4, 5, 6, 7, 8, 9\}$. Player $A$ goes first and ...
pinton jol's user avatar

15 30 50 per page
1
2 3 4 5
246