--- title: 'Three-Player Kuhn Poker: Equilibrium Analysis' url: https://www.emergentmind.com/topics/three-player-kuhn-poker type: topic --- # Three-Player Kuhn Poker: Equilibrium Analysis Searching arXiv for recent and foundational papers on three-player Kuhn poker and related equilibrium computation. {"query":"three-player Kuhn poker equilibrium multiplayer imperfect-information arXiv", "max_results": 10} arXiv search results: 1. 2606.25997 — "Variable Bound Tightening for Nash Equilibrium Computation in Multiplayer Imperfect-Information Games" 2. 2509.25618 — "Quadratic Programming Approach for Nash Equilibrium Computation in Multiplayer Imperfect-Information Games" 3. 2212.06027 — "Opponent Modeling in Multiplayer Imperfect-Information Games" 4. 1802.04670 — "Equilibrium solutions of three player Kuhn poker with N>3 cards: A new numerical method using regularization and arc-length continuation" 5. 1707.01392 — "Full street simplified three player Kuhn poker" 6. 1704.08124 — "Simplified three player Kuhn poker" Three-player Kuhn poker is a three-player imperfect-information poker game played with a four-card deck \(D=\{J,Q,K,A\}\), in which one distinct card is dealt to each player, each player antes 1 chip, and the hand is resolved after a single betting round with actions \(\{K,B,C,F\}\) subject to the usual legality restrictions [2212.06027]. Within the literature it functions as a compact setting for analyzing multiplayer Nash equilibrium, equilibrium multiplicity, repeated-play dynamics, exact sequence-form computation, and opponent exploitation. Research on the game and its variants shows that even this small extensive-form model can exhibit an infinite family of equilibria, multiple coexisting analytic solution branches, oscillatory adaptive dynamics, and substantial separation between equilibrium play and data-driven exploitation [2212.06027][1704.08124][1802.04670]. ## 1. Formal extensive-form structure In the standard formulation, chance deals one distinct card to each of the three players uniformly at random. Each player \(i\in\{1,2,3\}\) privately observes only their own card \(c_i\in D\), while the other cards remain hidden. For each player \(i\), each private card \(c\in D\), and each history prefix \(h\) at which it is \(i\)’s turn, there is an information set \(I_{i,c,h}\); all histories in the same information set are indistinguishable to that player [2212.06027]. The legal actions depend on whether a bet is already on the table. If no bet has yet been made, the player chooses between check \((K)\) and bet \((B)\). If a bet is on the table, the player chooses between call \((C)\) and fold \((F)\). The game has a single betting round, and histories are sequences over \(\{K,B,C,F\}\) with the usual restrictions. One exposition labels four aggressive-action situations: first move; after one check; after bet and one fold/call by player 2; and after bet and call by player 2 [2212.06027]. A terminal history ends when either two players have folded or when all remaining players have called or checked out. If \(\operatorname{pot}(h)\) denotes the total pot and \(\operatorname{Winner}(h)\) the highest card among players who have not folded, then player \(i\)’s utility is \[ u_i(h)= +[\operatorname{Winner}(h)=i]\cdot \operatorname{pot}(h) - 1\cdot(\text{chips}_i \text{ contributed to pot}), \] with the equivalent zero-sum normalization \(\sum_{i=1}^3 u_i(h)=0\) [2212.06027]. Later computational work reformulates the same game in sequence form. Each player’s strategy is represented by a realization-plan vector satisfying flow-conservation constraints, \[ E x = e,\qquad F y = f,\qquad G z = g,\qquad x,y,z\ge 0, \] where the first row of each constraint matrix enforces that the empty sequence has probability 1 [2606.25997]. ## 2. Nash equilibrium and equilibrium multiplicity A mixed-strategy profile \(\sigma^*=(\sigma_1^*,\ldots,\sigma_n^*)\) is a Nash equilibrium if, for each player \(i\), \[ u_i(\sigma_i^*,\sigma_{-i}^*) \ge u_i(\sigma_i,\sigma_{-i}^*) \quad \text{for all } \sigma_i. \] For three-player Kuhn poker, this condition is already nontrivial despite the game’s small size [2212.06027]. The standard four-card game admits an infinite family of equilibria parameterized by 21 real parameters, as noted in the literature summarized by Ganzfried and collaborators. In experimental work on opponent modeling, three “robust” representatives from this family were selected: \(N1\), a lower-bound equilibrium; \(N2\), an upper-bound equilibrium; and \(N3\), a midpoint (max-entropy) equilibrium [2212.06027]. A common misconception is that this game has a unique canonical equilibrium. The equilibrium family described above directly contradicts that view. Generalized analyses with \(N>3\) cards clarify why the \(N=4\) case is special. In the \(N=4\) deck, each player’s equilibrium strategy breaks cleanly into bluffing cards, calling cards, value-betting cards, and occasional sandbagging with the best card. This structure yields at most three coexisting equilibria for generic pot size \(P\), with exactly a continuum of equilibria at four special pot sizes, including \(P=3\). By contrast, for \(N>4\) the bluffing, calling, and value-betting ranges split into more complicated intervals, and the equilibrium-solution curve becomes much richer [1802.04670]. The same generalized study reports that \(N=5\) shows up to five distinct equilibria in some pot ranges, \(N=9\) can have up to 24 distinct coexisting equilibria near \(P\approx 7.5\), and \(N=10\) shows up to 15 branches for \(P\) up to \(1000\). When \(N\ge 6\), a new equilibrium feature appears: a mid-value card can be bet in a way that is a value bet against one opponent and a bluff against the other, a phenomenon absent in two-player and \(N=4\) games [1802.04670]. This suggests that three-player Kuhn poker is not merely a minimal extension of the two-player game; the multiplayer interaction changes the equilibrium geometry itself. ## 3. Analytic simplified variants One line of work studies “one-third street Kuhn poker,” in which Players 1 and 2 are forced to check, after which Player 3 may check or bet one unit; if Player 3 bets, Player 1 may fold or call, and then Player 2 may overcall or fold. Here the total pot is \(P\), with each player anteing \(P/3\), and the strategic frequencies are \(b_J,b_Q,c_Q,c_K,d_Q,d_K,o_K\) [1704.08124]. For the full one-third street game, the equilibrium classification depends sharply on \(P\). For \(P<2\), the unique equilibrium is trivial: no one bluffs or calls. For \(25\), \(b_Q\equiv 0\), \(c_Q\equiv 0\), and \(d_K\equiv 1\). The remaining frequencies are \(b_J\), \(c_K\), and \(d_Q\). In this model there is a unique equilibrium for \(5P^*\) there are exactly three distinct equilibria: \[ S_1=\left(\frac{2}{P+1},0,\frac{P-5}{P+1}\right),\quad S_2=\left(\frac{2}{P},\frac{P-5}{P+1},0\right),\quad S_3=\left(\frac{2}{P},\frac{2}{P+2},\frac{P^2-5P-12}{P(P+1)}\right). \] These three vectors satisfy the three best-response equations simultaneously and lie in \([0,1]^3\) only for \(P>P^*\) [1704.08124]. A separate “full street simplified” model imposes a different restriction: the weakest card, \(J\), is “dead,” meaning that any player holding \(J\) must always check and always fold. This reduces the number of nontrivial betting frequencies from 23 to 11, namely \[ \{a_1,a_2\},\ \{b_1,b_2,b_3\},\ \{c_1,c_2,c_3\},\ \{d_1,d_2,d_3\}, \] with \(a_3=1\). In this game there are three ranges of pot sizes for which three distinct coexisting equilibrium solutions occur: \(2\le P\le 3\); \(P_3\le P\le P_4\), where \(P_3=\frac14(3+\sqrt{97})\approx 3.21\) and \(P_4=\frac12(3+\sqrt{15})\approx 3.43\); and \(P_6\le P\le 4\), where \(P_6=\frac12(3+\sqrt{23})\approx 3.90\) [1707.01392]. ## 4. Dynamic adjustment and repeated play Three-player Kuhn poker has also been studied as a model of learning dynamics rather than only static equilibrium. In SKP, if one sets \(x_1=c_K\), \(x_2=d_Q\), and \(x_3=b_J\), a continuous-time learning model with logistic saturation yields \[ \dot x_3 = k_3 x_3(1-x_3)\left[\frac{P-5}{P+1}-x_2-x_1+x_2x_1\right], \] \[ \dot x_1 = k_1 x_1(1-x_1)\left[x_3-\frac{2}{P}\right], \] \[ \dot x_2 = k_2 x_2(1-x_2)\left[\frac{x_1-2}{P+1}+x_3(1-x_1)\right]. \] All three SKP equilibria are fixed points of this ODE system, but linearization shows that \(S_1\) and \(S_2\) are nonlinear centers with nested periodic orbits in invariant planes and a transverse stable direction, while \(S_3\) is a saddle with a two-dimensional stable manifold separating the two basins of attraction [1704.08124]. The same analysis concludes that generic orbits converge not to any equilibrium but to one of two families of limit cycles, described as “bistable oscillators,” oscillating around \(S_1\) or \(S_2\). For \(PP^*\) both coexist. In a discrete repeated-play model with memory lengths \(L_p\) and adjustment speeds \(k_p\), small \(k\) and moderate \(L\) produce trajectories that track the ODE cycles near \(S_2\), whereas larger \(k\) or larger \(L\) produce larger, noisier relaxation-oscillation cycles [1704.08124]. The full-street simplified model produces an analogous message at larger state dimension. Its adaptive ODE system is \[ \frac{df_i}{dt}=24\,k_i\,f_i(1-f_i)\,\frac{\partial E_i}{\partial f_i}, \] where \(f_i\) ranges over the 11 strategic frequencies. Every static equilibrium is a fixed point, but none of the equilibrium solutions is asymptotically stable: some are unstable, while others are non-hyperbolic with center manifolds on which nearby orbits oscillate. Depending on \(P\), numerical integration yields periodic motion, motion close to periodic, or long chaotic transients. At the same time, the long-run profit slopes \(p_i(t)/t\) closely match the static equilibrium payoff of the nearby equilibrium being shadowed [1707.01392]. A plausible implication is that, in this domain, equilibrium analysis predicts long-run profitability more robustly than it predicts pointwise convergence of strategies. ## 5. Exact equilibrium computation Recent work formulates exact Nash equilibrium computation in three-player Kuhn poker as a nonlinear complementarity problem and then as a nonconvex quadratically constrained feasibility program. For each player \(p\), the KKT conditions for best response consist of stationarity, primal feasibility, dual feasibility, and complementary slackness. Stacking the three players’ systems yields an NLCP in the realization plans, multipliers, and slack variables, with nonlinearity arising from bilinear payoff terms such as \(y_j z_k\), \(x_i z_k\), and \(x_i y_j\), together with complementarity terms such as \(x_i r_i^1=0\) [2606.25997]. To obtain a QCP, auxiliary bilinear variables are introduced: \[ p_{ij}=x_i y_j,\qquad q_{ik}=x_i z_k,\qquad w_{jk}=y_j z_k, \] and similarly for the complementarity products. This makes the stationarity equations linear in the expanded variable set, while preserving the quadratic equalities. Because all nonlinearities are bilinear, the formulation is amenable to spatial branch-and-bound with McCormick envelopes [2606.25997]. A 2025 implementation on the reduced game after removal of dominated actions reports the following dominated actions as safely prunable: calling a bet with Jack; folding to a bet with Ace; calling a bet with Queen after a bet and a call; and checking with Ace after two consecutive checks. After pruning, the game tree shrinks from 288 decision nodes to 252, and total nodes go from 601 to 415, while the number of information sets per player remains 16. The resulting QCP has 72 linear rows, 249 columns, and 198 explicit bilinear constraints, and the global solve time reported for Gurobi is 2.47 seconds, with verified \(\epsilon\)-Nash error approximately \(1.4\times 10^{-17}\) [2509.25618]. A 2026 refinement derives finite bounds on slack and multiplier variables. In three-player Kuhn poker, terminal payoffs lie in \([-2,+3]\), which yields \[ 0\le r\le 5,\qquad |\lambda|\le 128. \] Injecting these bounds produces tighter McCormick envelopes. Reported solve times on an Intel i7-1065G7 are \(>24\) hours with no bounds, \(1.160\) s with slack bounds only, \(9.257\) s with multiplier bounds only, and \(3.299\) s with both bounds. The same study states that the slack-bounds-only configuration yields both the fastest solve and the smallest branch-and-bound tree [2606.25997]. This suggests that, in multiplayer extensive-form equilibrium computation, bounding complementarity slack variables can matter more than tightening dual multipliers. ## 6. Opponent modeling and exploitative play Three-player Kuhn poker also serves as a testbed for opponent modeling in repeated multiplayer imperfect-information games. In the Bayesian best-response approach of Ganzfried, Wang, and Chiswick, offline sampling begins from a prior mean \(\sigma_{i,j}\) for each opponent \(i\in\{2,3\}\) and each position \(j\in\{1,2,3\}\); the midpoint equilibrium \(N3\) is used for all opponent priors. Action probabilities are clipped into \([\epsilon,1-\epsilon]\), \(k\) independent Dirichlet samples are drawn with parameters \(\alpha_a=\eta\cdot \sigma_{i,j}(a)\), and the initial prior weight over sample pairs is uniform, \(p_0(s_2,s_3)=1/k^2\) [2212.06027]. Online play uses a switch-over schedule. For \(t\le H_0\), the agent plays the lower-bound equilibrium \(N1\); afterward it computes posterior mean opponent models \(m_{i,j}\), forms a best response \(BR_t\), and plays that strategy. After each hand, the posterior over opponent sample indices is updated by Bayes’ rule using the likelihood of the observed public actions and any private cards revealed at showdown [2212.06027]. The evaluation includes ten “class-project” agents \(C1,\ldots,C10\) and the three exact-equilibrium agents \(N1,N2,N3\). For each unordered triple of agents, all 6 seating permutations are played; each match consists of 3,000 hands per seating, and the match is duplicated with the same random deals for variance reduction. Performance is measured by average win rate in millichips per hand, \[ \operatorname{WinRate}_i = 1{,}000\times (E[u_i]\ \text{over all hands}), \] with reported standard errors approximately \(0.4\)–\(0.6\) millichips per hand [2212.06027]. The reported win-rate ordering is led by the Bayesian best-response agent, MBBR, at \(+48\), followed by \(N1\) at \(+37\), \(N3\) at \(+35\), and then the class agents down to \(C10\) at \(-172\). The paper states that MBBR “strictly outperform[s] all exact Nash equilibria (best of which earned \(+37\)) and all class-project bots.” It also reports that replacing the equilibrium-based prior with a naive \(\operatorname{Dirichlet}(\alpha=2)\) uninformed prior causes MBBR to drop near the bottom of the field [2212.06027]. Within this experimental setting, equilibrium serves as a safe prior and early-game policy, while posterior exploitation captures additional value against weaker or systematically biased opponents. Source: https://www.emergentmind.com/topics/three-player-kuhn-poker