On Existence and Computational Complexity of Quasi-strict Equilibria

Kristoffer Arnsfelt Hansen; Xinhao Nie

REVIEW

On Existence and Computational Complexity of Quasi-strict Equilibria

Computer Science and Game Theory · Submitted 4 Nov 2026 · 36 references

Pith's verdict: Settles the PPAD complexity of quasi-strict Nash equilibria in bimatrix games and the ∃R complexity in multiplayer games, with a clean new existence proof.

T0 · AI review

How this review was made: An AI referee (deepseek/deepseek-v4-flash) read the paper on November 5, 2026 and answered a fixed list of questions about it. T0 is the starting level every paper gets. The levels describe how deeply Pith has checked the paper, never the authors.

T0 AI review An AI read the paper and answered a fixed list of questions.
T1 Audit Automatic checks that the references and files the paper relies on exist and match.
T2 Compute The paper's code or calculations re-run with the same results.
T3 Formal statement The claims written out in a formal math language a computer can read.
T4 Proof Those claims proved, and the proof checked by computer.

How Pith checks papers →

· 4 major objections · 6 minor · Ask about this paper · The compiled record · Read the full review →

Challenge this review Comment (0) Read on arXiv ↗

Cite ▾

arXiv ID2611.06350 (version 1)

Pith IDLRBNZI4C, Pith's permanent record of this paper and its review

CitationKristoffer Arnsfelt Hansen, Xinhao Nie. "On Existence and Computational Complexity of Quasi-strict Equilibria." arXiv:2611.06350 (2026). https://pith.science/paper/LRBNZI4C

Cite this reviewBibTeX for Pith's review of this paper

Claim paper

Why Pith says this

Highlight any text to comment on it.

Editor's note

read the letter

This paper resolves two open problems about quasi-strict Nash equilibria: it proves PPAD-completeness for computing one in bimatrix games (was open for membership), and ∃R-completeness for deciding existence in games with 3+ players. Both results are solid and the paper deserves a serious referee.

What I like most is the new proof of Norde's theorem. It replaces the intricate limit argument with a clever simplicial construction—using order complexes of the best-response face posets and four simplicial maps—that is both cleaner and symmetric across players. That alone is a nice contribution.

The PPAD membership proof is the main technical work. It makes the existence proof effective by defining interior points via linear programming (avoiding vertex enumeration) and then encoding the self-map into the Etessami–Yannakakis polynomial piecewise-linear fixed-point framework. The oracle algorithm (Lemma 5) that walks down the face chain using linear comparisons is detailed and appears correct. The stress-test reviewer checked it carefully and found no gaps; I agree after reading the paper. The reduction for ∃R-hardness uses a known minmax hardness result and a clean zero-sum game construction; that part is straightforward but correctly argued.

Soft spots: these are minor. The PPAD membership algorithm is intricate, and the paper does not provide a formal complexity analysis of the LP steps within the oracle (it cites standard results, which is fine). The exposition in Lemma 5 is dense and could benefit from a diagram or a running example. But the reasoning is logically consistent, and the polynomial bounds are plausible. The paper also states it used ChatGPT-6 Astra to assist in proofs and writing; that’s transparent but some readers may want independent verification of the trickiest step (the recovery of the equilibrium from the fixed point). Since the authors take responsibility and claim to have verified all proofs, I take them at their word.

Overall, this is a serious piece of work. It closes a well-known open question, provides novel techniques, and the proofs are written with care. I would cite it and bring it to a reading group. I recommend accepting it for peer review; it is not a desk reject.

Referee report

Major objections (4)

[Lemma 5] The oracle algorithm that locates the simplex containing a given point is described in detail, but a formal correctness proof is not provided. The algorithm uses a tie-breaking rule when multiple facets achieve the same minimum ratio, and also handles the degenerate case where the current iterate equals the selected interior point. The paper should argue that the resulting face chain indeed yields the unique minimal simplex containing the point (or at least a simplex that suffices for the extraction of a quasi-strict equilibrium).
[Lemma 5, update of C_i] The matrices C_i are updated by multiplying with a rational projection matrix. The paper asserts that these matrices have polynomial encoding length, but no explicit bound or growth analysis is given. Since these matrices are constructed iteratively and each step involves rational arithmetic, a brief justification that the encoding size remains polynomial in |I| would strengthen the argument.
[Lemma 5, label update for J_{i-1}] The update rule for J_{i-1} adds all b∈ N\J_i that become best responses on the facet. However, the description says 'max_{v∈F_{i-1}} (B^⊤v)_{j_0} - (B^⊤v)_b = 0'. It would be clearer to explicitly state that this means the equality holds for all v in the facet (or at least for a point in its relative interior). The current phrasing could be misinterpreted.
[Section 4, after Lemma 4] When composing Π_m with h_1, the paper asserts that the composition satisfies the second condition of Definition 6 because both components do. However, the composition may require a refinement of the cell structure to ensure that the image of a cell of h_1 lies entirely within a region of Π_m where a single affine formula applies. The paper addresses this by taking the union of divisive hyperplanes, but a more explicit mention of how this refinement is constructed (e.g., by intersecting the preimages of Π_m's regions with the cells of h_1) would be helpful.

Minor objections (6)

[Lemma 5] The algorithm uses exact rational arithmetic. The paper should explicitly note that all operations (including the ratio h^*(u_i)/h^*(p_i) and the matrix update) are performed over the rational numbers, and that the sizes are bounded.
[Proof of Theorem 5] In the verification that S_1(x̄) = R_1(ȳ) and S_2(ȳ) = R_2(x̄), the argument uses that ∑_i (R_1(ȳ))_i = 1. This follows because R_1(ȳ) ∈ Δ_m. It might be useful to note this explicitly.
[§5, hardness proof] When constructing the game Ĝ for the reduction, the payoff for action ⊥_1 when player 2 plays X and player 3 plays Y is given as (0,0,0) but the text says 'Every payoff vector sums to zero'. That block has payoff (0,0,0), which sums to zero, so it is fine. Consider clarifying that the block entries are vectors of length 3.
[Figure captions] The figures are clear and illustrative. However, the labels in Figure 2 and 3 could be slightly larger for readability in print.
[Typographical] On page 14, line after Lemma 3: 'It admits that their rational coordinates have a polynomial encoding length' should be 'It ensures that their rational coordinates have polynomial encoding length'.
[References] The paper [Ope26] is a preprint that may not be peer-reviewed; the authors might wish to note this status, though it is not required.

How Pith checks papers → · Full audit of this paper →

The paper

The paper claims

Two theorems settle the complexity of quasi-strict Nash equilibria: PPAD-complete for two-player games, ∃R-complete for three or more.

The reading

This paper resolves the computational complexity of quasi-strict Nash equilibria, a refinement of Nash equilibrium requiring each pure best response to be played with positive probability. For two-player bimatrix games, computing such an equilibrium is shown to be PPAD-complete, matching the complexity of ordinary Nash equilibria and settling an open question. For games with three or more players, where quasi-strict equilibria may fail to exist, the decision problem of whether one exists is proved to be ∃R-complete, even for zero-sum games. The paper also provides a substantially simpler proof of the existence theorem (originally due to Norde) that avoids intricate limit arguments, and this new proof is essential for establishing the PPAD membership. These results place quasi-strict equilibrium alongside other well-known refinements in the complexity landscape.

What carries the argument

The central object is a continuous self-map T' on Δ_m × Δ_n built from four simplicial maps: S₁ and R₁ (from Δ_m to Δ_m and from Δ_n to Δ_m, respectively) and S₂ and R₂ (analogous for the second player), whose vertex images are barycenters of support sets or best-response sets, composed with Euclidean projection to ensure piecewise linearity. Fixed points of T' satisfy S₁(x)=R₁(y) and S₂(y)=R₂(x), and from these the paper extracts a quasi-strict equilibrium by looking at the outermost faces of the face chains representing x and y.

Extended reading notes

Core claim

The paper establishes two main theorems: (1) Computing a quasi-strict Nash equilibrium of a bimatrix game is PPAD-complete, and (2) For every fixed n ≥ 3, deciding whether an n-player strategic-form game with rational payoffs admits a quasi-strict Nash equilibrium is ∃R-complete, even for zero-sum games. The PPAD membership proof follows from a new existence argument that constructs a continuous piecewise-linear self-map on the product of strategy simplices using simplicial complexes derived from best-response regions and the barycentric subdivisions of the strategy simplices, together with the Euclidean projection. A polynomial-time oracle algorithm locates the cell containing a given point, making the map a polynomial piecewise-linear fixed-point problem in the sense of Etessami and Yannakakis, whose fixed points yield quasi-strict equilibria. The ∃R-hardness for three or more players is obtained by a reduction from the minmax-value decision problem for three-player games, leveraging known ∃R-hardness results.

Load-bearing premise

The PPAD membership proof assumes that the construction of the piecewise-linear self-map T' and the polynomial-time oracle algorithm that locates the cell containing a given point are both correct and run in polynomial time; if the algorithm for finding the face chain fails on some input (e.g., due to numerical issues in linear programming), the PPAD membership might not hold.

Editorial extensions

If this is right

The PPAD-completeness result means that computing a quasi-strict Nash equilibrium is exactly as hard as computing an ordinary Nash equilibrium in bimatrix games, ruling out a polynomial-time algorithm (unless PPAD = FP).
The ∃R-completeness result shows that deciding existence of a quasi-strict equilibrium in three or more players is at least as hard as the existential theory of the reals, making it unlikely to be in NP.
The new existence proof simplifies Norde's argument and provides a template for proving PPAD membership of other equilibrium refinements that do not form closed sets of fixed points.
The reduction to the Etessami–Yannakakis framework may allow other total search problems in game theory to be classified as PPAD using similar simplicial-map constructions.
The zero-sum case for three players is still ∃R-complete, indicating that the zero-sum property does not simplify the decision problem for quasi-strict equilibria.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The method of refining a polyhedral complex by order complexes and using simplicial maps may extend to other equilibrium refinements with non-closed solution sets, such as proper equilibria or sequential equilibria in extensive-form games.
The paper's reliance on linear programming to compute relative interior points in polynomial time suggests that other geometric constructions in game complexity can be made effective by similar techniques.
The ∃R-completeness for three-player zero-sum games implies that quasi-strict equilibrium existence is a rare example of a decision problem about a subclass of Nash equilibria that is strictly harder than NP, even under the zero-sum restriction.
The PPAD membership proof could be adapted to show that computing a quasi-strict equilibrium in bimatrix games with integer payoffs is in PPAD, and the reduction from Nash equilibrium (PPAD-hard) shows that the problem is no easier than Nash.

Original abstract

Quasi-strict Nash equilibrium, introduced by Harsanyi in 1973, is the Nash equilibrium refinement that requires every pure best response to be played with positive probability. Norde established that any bimatrix game admits a quasi-strict Nash equilibrium. We give a substantially simpler proof of this result that in particular avoids an intricate limit argument used in the final step of the proof by Norde. Our existence proof allows us to positively resolve the outstanding open question of PPAD membership of the problem of computing a quasi-strict Nash equilibrium, thereby settling its precise complexity. In games with three or more players, a quasi-strict Nash equilibrium is not guaranteed to exist, leading to the natural problem of deciding the existence of a quasi-strict Nash equilibrium in a given strategic form game. We show that this problem is $\exists\mathbb{R}$-complete, strengthening a previous NP-hardness result.

The compiled record

The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-11-05: 1 request, 4,932 input tokens.

What the abstract itself states, as probabilities: claims first 0.12 · states limitation 0.40 · human participants 0.02 · controlled comparison 0.02 · randomized assignment 0.01 · states quantitative result 0.17 · compares with prior results 0.94 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; show every role.

Quasi-strict Nash equilibrium, introduced by Harsanyi in 1973, is the Nash equilibrium refinement that requires every pure best response to be played with positive probability. Norde established that any bimatrix game admits a quasi-strict Nash equilibrium. We give a substantially simpler proof of this result that in particular avoids an intricate limit argument used in the final step of the proof by Norde. Our existence proof allows us to positively resolve the outstanding open question of PPAD membership of the problem of computing a quasi-strict Nash equilibrium, thereby settling its precise complexity. In games with three or more players, a quasi-strict Nash equilibrium is not guaranteed to exist, leading to the natural problem of deciding the existence of a quasi-strict Nash equilibrium in a given strategic form game. We show that this problem is $\exists\mathbb{R}$-complete, strengthening a previous NP-hardness result.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#	sentence	role	the authors' own work	states the main conclusion	strength
s0	Quasi-strict Nash equilibrium, introduced by Harsanyi in 1973, is the Nash equilibrium refinement that requires every pure best response to be played with positive probability.	background 1.00	0.03	0.02	asserted 1.00
s1	Norde established that any bimatrix game admits a quasi-strict Nash equilibrium.	background 1.00	0.02	0.04	asserted 1.00
s2	We give a substantially simpler proof of this result that in particular avoids an intricate limit argument used in the final step of the proof by Norde.	contribution 0.91	0.95	0.06	asserted 1.00
s3	Our existence proof allows us to positively resolve the outstanding open question of PPAD membership of the problem of computing a quasi-strict Nash equilibrium, thereby settling its precise complexity.	result 0.82	0.95	0.66	asserted 1.00
s4	In games with three or more players, a quasi-strict Nash equilibrium is not guaranteed to exist, leading to the natural problem of deciding the existence of a quasi-strict Nash equilibrium in a given strategic form game.	background 0.67	0.08	0.05	asserted 1.00
s5	We show that this problem is $\exists\mathbb{R}$-complete, strengthening a previous NP-hardness result.	result 0.93	0.95	0.19	asserted 1.00

What kind of paper the classifier reports this is: theoretical result 1.00 · evidence from proof or derivation 1.00.

What was examined, and what was not

sources read

arXiv listing abstract v1

not examined

full text
figures and tables
references and citing sentences
relations to other papers

levels run

P abstract

not run

S sections
T body sentences
C citations
R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

Figures

**Figure 1.** Best-response partitions induced by BR1 on ∆n (left) and BR2 on ∆m (right). Definition 2 (Simplex and Simplicial Complex). Let {a0, a1, . . . , an} be an affinely independent point set in R n . The n-simplex spanned by these points is the set of all points x ∈ R n such that x = Xn i=0 tiai where Pn i=0 ti = 1 and ti ≥ 0 for each i. For each point x in the simplex, the coefficients ti are uniquely determined. They are called the barycentric coordinates of x with respect to a0, . . . , an. A simplicial complex K in R n is a collection of simplices in R n such that: 1. Every f

**Figure 2.** Barycentric subdivisions of the best-response complexes on

**Figure 3.** A simplicial map R1 : ∆3 → ∆3. The shaded simplices correspond under qi 7→ ri . Additionally, we need some basic properties of product spaces from [Mun00, Theorem 18.2, Theorem 18.4 and Theorem 26.7]. Proposition 3. The following hold: 1. Let X ⊆ R m and Y ⊆ R n be polytopes. The function f : X × Y → X × Y is continuous if and only if the coordinate functions f1 : X × Y → X and f2 : X × Y → Y are continuous. 2. Let f : X → R r be continuous. Then the function f ◦ πX : X × Y → R r is continuous. 3. For two simplices ∆m and ∆n, the product ∆m × ∆n is a nonempty compact convex subs

Figures reproduced from arXiv:2611.06350 by the authors.

References

Works cited (36)

[1]

Brouwer, L. E. J. , title =. Mathematische Annalen , year =

View on Pith
[2]

Kakutani, Shizuo , journal=. A generalization of. 1941 , doi =

View on Pith 1941
[3]

Bimatrix games have quasi-strict equilibria. , author=. Mathematical Programming , volume=

View on Pith
[4]

Topology , author=. 2000 , publisher=

View on Pith 2000
[5]

Elements Of Algebraic Topology , author=. 2018 , publisher=

View on Pith 2018
[6]

Bj. Topological Methods , booktitle =

View on Pith
[7]

Nash, John , title =. Annals of Mathematics , volume =. 1951 , doi =

View on Pith 1951
[8]

Etessami, Kousha and Yannakakis, Mihalis , journal=. On the complexity of. 2010 , publisher=

View on Pith 2010
[9]

Brandt, Felix and Fischer, Felix. On the Hardness and Existence of Quasi-Strict Equilibria. Algorithmic Game Theory. 2008

View on Pith 2008
[10]

Andrew McLennan and Rabee Tourky , title =. Games and Economic Behavior , volume =. 2010 , issn =

View on Pith 2010
[11]

Brandl, Florian and Brandt, Felix , title =. Theoretical Economics , volume =. doi:10.3982/TE5825 , year =

View on Pith doi:10.3982/te5825
[12]

Equilibrium points of bimatrix games , author=. Journal of the Society for industrial and Applied Mathematics , volume=. 1964 , publisher=

View on Pith 1964
[13]

On the complexity of the parity argument and other inefficient proofs of existence , author=. Journal of Computer and system Sciences , volume=. 1994 , publisher=

View on Pith 1994
[14]

Chen, Xi and Deng, Xiaotie and Teng, Shang-Hua , journal=. Settling the complexity of computing two-player. 2009 , publisher=

View on Pith 2009
[15]

Chen, Xi and Deng, Xiaotie , booktitle=. 3-

View on Pith
[16]

Daskalakis, Constantinos and Goldberg, Paul W and Papadimitriou, Christos H , journal=. The complexity of computing a. 2009 , publisher=

View on Pith 2009
[17]

Games with randomly disturbed payoffs: A new rationale for mixed-strategy equilibrium points , author=. International journal of game theory , volume=. 1973 , publisher=

View on Pith 1973
[18]

Oddness of the number of equilibrium points: A new proof , author=. International journal of game theory , volume=. 1973 , publisher=

View on Pith 1973
[19]

Refinements of the Nash Equilibrium Concept. 1983

View on Pith 1983
[20]

Eric van Damme , title =. 1991 , isbn =

View on Pith 1991
[21]

David Squires , title =. Theory and Decision , year =

View on Pith
[22]

Cubitt, Robin P. and Sugden, Robert , title =. The Economic Journal , volume =. 1994 , publisher =

View on Pith 1994
[23]

A new polynomial-time algorithm for linear programming , author=. Proceedings of the sixteenth annual ACM symposium on Theory of computing , pages=

View on Pith
[24]

Polynomial algorithms in linear programming , author=. USSR Computational Mathematics and Mathematical Physics , volume=. 1980 , publisher=

View on Pith 1980
[25]

The real computational complexity of minmax value and equilibrium refinements in multi-player games , author=. Theory of Computing Systems , volume=. 2019 , publisher=

View on Pith 2019
[26]

Canny, John , booktitle=. Some algebraic and geometric computations in

View on Pith
[27]

Berthelsen, Marie Louisa T. On the computational complexity of decision problems about multi-player. Theory of Computing Systems , volume=. 2022 , publisher=

View on Pith 2022
[28]

Geometric Algorithms and Combinatorial Optimization , author=. 2012 , publisher=

View on Pith 2012
[29]

Reinhard Selten. A Reexamination of the Perfectness Concept for Equilibrium Points in Extensive Games. International Journal of Game Theory

View on Pith
[30]

R. B. Myerson. Refinements of the Nash Equilibrium Concept. International Journal of Game Theory

View on Pith
[31]

von Stengel, Bernhard and van den Elzen, Antoon and Talman, Dolf , title =. Econometrica , volume =. 2002 , doi =

View on Pith 2002
[32]

Peter Bro Miltersen and Troels Bjerre S. Computing Proper Equilibria of Zero-Sum Games , booktitle =. 2007 , url =

View on Pith 2007
[33]

Troels Bjerre S rensen. Computing a proper equilibrium of a bimatrix game. ACM Conference on Electronic Commerce, EC '12. 2012

View on Pith 2012
[34]

Kousha Etessami and Kristoffer Arnsfelt Hansen and Peter Bro Miltersen and Troels Bjerre S rensen. The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form. SAGT 2014. 2014

View on Pith 2014
[35]

Hansen, Kristoffer Arnsfelt and Lund, Troels Bjerre , title =. Proceedings of the 2018 ACM Conference on Economics and Computation , series =. doi:10.1145/3219166.3219199 , publisher =

View on Pith doi:10.1145/3219166.3219199 2018
[36]

Paul Milgrom and Joshua Mollner , journal =. EQUILIBRIUM SELECTION IN AUCTIONS AND HIGH STAKES GAMES , volume =

View on Pith

Discussion

Disagree with the review, or know something it missed? Leave a comment, highlight any passage above to comment on it, or challenge this review formally.

[1] [1]

Brouwer, L. E. J. , title =. Mathematische Annalen , year =

View on Pith

[2] [2]

Kakutani, Shizuo , journal=. A generalization of. 1941 , doi =

View on Pith 1941

[3] [3]

Bimatrix games have quasi-strict equilibria. , author=. Mathematical Programming , volume=

View on Pith

[4] [4]

Topology , author=. 2000 , publisher=

View on Pith 2000

[5] [5]

Elements Of Algebraic Topology , author=. 2018 , publisher=

View on Pith 2018

[6] [6]

Bj. Topological Methods , booktitle =

View on Pith

[7] [7]

Nash, John , title =. Annals of Mathematics , volume =. 1951 , doi =

View on Pith 1951

[8] [8]

Etessami, Kousha and Yannakakis, Mihalis , journal=. On the complexity of. 2010 , publisher=

View on Pith 2010

[9] [9]

Brandt, Felix and Fischer, Felix. On the Hardness and Existence of Quasi-Strict Equilibria. Algorithmic Game Theory. 2008

View on Pith 2008

[10] [10]

Andrew McLennan and Rabee Tourky , title =. Games and Economic Behavior , volume =. 2010 , issn =

View on Pith 2010

[11] [11]

Brandl, Florian and Brandt, Felix , title =. Theoretical Economics , volume =. doi:10.3982/TE5825 , year =

View on Pith doi:10.3982/te5825

[12] [12]

Equilibrium points of bimatrix games , author=. Journal of the Society for industrial and Applied Mathematics , volume=. 1964 , publisher=

View on Pith 1964

[13] [13]

On the complexity of the parity argument and other inefficient proofs of existence , author=. Journal of Computer and system Sciences , volume=. 1994 , publisher=

View on Pith 1994

[14] [14]

Chen, Xi and Deng, Xiaotie and Teng, Shang-Hua , journal=. Settling the complexity of computing two-player. 2009 , publisher=

View on Pith 2009

[15] [15]

Chen, Xi and Deng, Xiaotie , booktitle=. 3-

View on Pith

[16] [16]

Daskalakis, Constantinos and Goldberg, Paul W and Papadimitriou, Christos H , journal=. The complexity of computing a. 2009 , publisher=

View on Pith 2009

[17] [17]

Games with randomly disturbed payoffs: A new rationale for mixed-strategy equilibrium points , author=. International journal of game theory , volume=. 1973 , publisher=

View on Pith 1973

[18] [18]

Oddness of the number of equilibrium points: A new proof , author=. International journal of game theory , volume=. 1973 , publisher=

View on Pith 1973

[19] [19]

Refinements of the Nash Equilibrium Concept. 1983

View on Pith 1983

[20] [20]

Eric van Damme , title =. 1991 , isbn =

View on Pith 1991

[21] [21]

David Squires , title =. Theory and Decision , year =

View on Pith

[22] [22]

Cubitt, Robin P. and Sugden, Robert , title =. The Economic Journal , volume =. 1994 , publisher =

View on Pith 1994

[23] [23]

A new polynomial-time algorithm for linear programming , author=. Proceedings of the sixteenth annual ACM symposium on Theory of computing , pages=

View on Pith

[24] [24]

Polynomial algorithms in linear programming , author=. USSR Computational Mathematics and Mathematical Physics , volume=. 1980 , publisher=

View on Pith 1980

[25] [25]

The real computational complexity of minmax value and equilibrium refinements in multi-player games , author=. Theory of Computing Systems , volume=. 2019 , publisher=

View on Pith 2019

[26] [26]

Canny, John , booktitle=. Some algebraic and geometric computations in

View on Pith

[27] [27]

Berthelsen, Marie Louisa T. On the computational complexity of decision problems about multi-player. Theory of Computing Systems , volume=. 2022 , publisher=

View on Pith 2022

[28] [28]

Geometric Algorithms and Combinatorial Optimization , author=. 2012 , publisher=

View on Pith 2012

[29] [29]

Reinhard Selten. A Reexamination of the Perfectness Concept for Equilibrium Points in Extensive Games. International Journal of Game Theory

View on Pith

[30] [30]

R. B. Myerson. Refinements of the Nash Equilibrium Concept. International Journal of Game Theory

View on Pith

[31] [31]

von Stengel, Bernhard and van den Elzen, Antoon and Talman, Dolf , title =. Econometrica , volume =. 2002 , doi =

View on Pith 2002

[32] [32]

Peter Bro Miltersen and Troels Bjerre S. Computing Proper Equilibria of Zero-Sum Games , booktitle =. 2007 , url =

View on Pith 2007

[33] [33]

Troels Bjerre S rensen. Computing a proper equilibrium of a bimatrix game. ACM Conference on Electronic Commerce, EC '12. 2012

View on Pith 2012

[34] [34]

Kousha Etessami and Kristoffer Arnsfelt Hansen and Peter Bro Miltersen and Troels Bjerre S rensen. The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form. SAGT 2014. 2014

View on Pith 2014

[35] [35]

Hansen, Kristoffer Arnsfelt and Lund, Troels Bjerre , title =. Proceedings of the 2018 ACM Conference on Economics and Computation , series =. doi:10.1145/3219166.3219199 , publisher =

View on Pith doi:10.1145/3219166.3219199 2018

[36] [36]

Paul Milgrom and Joshua Mollner , journal =. EQUILIBRIUM SELECTION IN AUCTIONS AND HIGH STAKES GAMES , volume =

View on Pith