On the computation of stable sets for bimatrix games

DOI10.1016/J.JMATECO.2004.09.003zbMATH Open1136.91313OpenAlexW2048407366MaRDI QIDQ2571925FDOQ2571925

Dries Vermeulen, Mathijs Jansen

Publication date: 14 November 2005

Published in: Journal of Mathematical Economics (Search for Journal in Brave)

Full work available at URL: https://cris.maastrichtuniversity.nl/ws/files/597937/guid-2b82336f-3a4c-468b-ad1a-aac60d200638-ASSET1.0.pdf

Recommendations

• On the computation of stable sets and strictly perfect equilibria.
• Nash equilibria in perturbation-stable games
• Computing Simply Stable Equilibria
• scientific article
• scientific article; zbMATH DE number 540437

zbMATH Keywords

ComputationBimatrix gamesStable sets

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Noncooperative games (91A10) 2-person games (91A05)

Cites Work

• Title not available (Why is that?)
• On the Strategic Stability of Equilibria
• Maximal stable sets of two-player games
• On the Definition of the Strategic Stability of Equilibria
• Stable Equilibria—A Reformulation
• Stable Equilibria—A Reformulation. Part II. Discussion of the Definition, and Further Results
• Ordinality in non cooperative games
• On the relation among some definitions of strategic stability.
• Ordinality of solutions of noncooperative games

Cited In (4)

• Index and stability in bimatrix games. A geometric-combinatorial approach.
• On the computation of stable sets and strictly perfect equilibria.
• Stable sets and max-convex decompositions of TU games
• On the topology of the set of Nash equilibria

This page was built for publication: On the computation of stable sets for bimatrix games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2571925)