On nash subsets and mobility chains in bimatrix games

DOI10.1002/nav.3800230213zbMath0349.90136OpenAlexW2014218376MaRDI QIDQ4120352

C. B. Millham, Gerald A. Heuer

Publication date: 1976

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800230213

Mathematics Subject Classification ID

Noncooperative games (91A10) Linear programming (90C05)

Related Items (11)

Nash refinements of equilibria ⋮ On strictly proper equilibria ⋮ On constructing games with a convex set of equilibrium strategies ⋮ On the set of proper equilibria of a bimatrix game ⋮ A note on bimatrix game maximal Selten subsets ⋮ Pareto equilibria for bimatrix games ⋮ On the structure of the set of perfect equilibria in bimatrix games ⋮ An amalgation of games ⋮ A note on correlated equilibrium ⋮ A note on polymatrix games ⋮ NASH EQUILIBRIA FROM THE CORRELATED EQUILIBRIA VIEWPOINT

Cites Work

• Unnamed Item

This page was built for publication: On nash subsets and mobility chains in bimatrix games