Question

Prove it is impossible for every male to be paired with their last choice in the stable marriage algorithm (male proposing)

score 365 · Answer 1 · 2026-03-25 07:44:35

365

Views

Prove it is impossible for every male to be paired with their last choice in the stable marriage algorithm (male proposing)

Published on 25 Mar 2026 - 7:44

score 70 · Answer 2 · 2026-03-17 15:13:12

70

Views

proving if player 1 has a pure optimal strategy, player 2 should as well

Published on 17 Mar 2026 - 15:13

score 5.2k · Answer 3 · 2026-03-25 07:49:11

5.2k

Views

Nash equilibrium in second price sealed-bid auction

Published on 25 Mar 2026 - 7:49

score 66 · Answer 4 · 2026-03-17 09:07:19

66

Views

is there a winning strategy, and if so what is it?

Published on 17 Mar 2026 - 9:07

score 54 · Answer 5 · 2026-03-16 21:21:22

54

Views

Altruistic rational agent

Published on 16 Mar 2026 - 21:21

score 44 · Answer 6 · 2026-03-17 09:30:15

44

Views

Why behavioral strategies and sequence form do not work with imperfect recall games?

Published on 17 Mar 2026 - 9:30

score 191 · Answer 7 · 2026-03-17 02:44:35

191

Views

Is the set of nash equilibria/correlated equilibria convex?

Published on 17 Mar 2026 - 2:44

score 341 · Answer 8 · 2026-03-17 05:20:13

341

Views

How to find potential function for any game?

Published on 17 Mar 2026 - 5:20

score 574 · Answer 9 · 2026-03-16 19:02:40

574

Views

$3$ scorpions are chasing $1$ ant on the edges of a cube. The ant is $3$ times as fast than any scorpion. Can the ant survive?

Published on 16 Mar 2026 - 19:02

score 144 · Answer 10 · 2026-03-16 19:11:05

144

Views

How to solve this variation of nim that has division?

Published on 16 Mar 2026 - 19:11

score 127 · Answer 11 · 2026-03-16 20:22:57

127

Views

Game theory problem - two towers

Published on 16 Mar 2026 - 20:22

score 179 · Answer 12 · 2026-03-17 02:12:15

179

Views

End-of-the-Line (PPAD) complexity

Published on 17 Mar 2026 - 2:12

score 51 · Answer 13 · 2026-02-23 04:33:47

51

Views

Play Cards Game Tournament Algorithm

Published on 23 Feb 2026 - 4:33

score 209 · Answer 14 · 2026-03-16 22:09:41

209

Views

Minimize the probability of winning a game with infinite independent $U(0, 1)$ random variables

Published on 16 Mar 2026 - 22:09

score 391 · Answer 15 · 2026-03-25 09:31:36

391

Views

Game Theory - Nash equilibrium question

Published on 25 Mar 2026 - 9:31

List Question

Prove it is impossible for every male to be paired with their last choice in the stable marriage algorithm (male proposing)

proving if player 1 has a pure optimal strategy, player 2 should as well

Nash equilibrium in second price sealed-bid auction

is there a winning strategy, and if so what is it?

Altruistic rational agent

Why behavioral strategies and sequence form do not work with imperfect recall games?

Is the set of nash equilibria/correlated equilibria convex?

How to find potential function for any game?

$3$ scorpions are chasing $1$ ant on the edges of a cube. The ant is $3$ times as fast than any scorpion. Can the ant survive?

How to solve this variation of nim that has division?

Game theory problem - two towers

End-of-the-Line (PPAD) complexity

Play Cards Game Tournament Algorithm

Minimize the probability of winning a game with infinite independent $U(0, 1)$ random variables

Game Theory - Nash equilibrium question

Trending Questions

Popular # Hahtags

Popular Questions