On the determinateness of semi-infinite bimatrix games

DOI10.1007/BF01240151zbMath0794.90079MaRDI QIDQ2366100

S. H. Tijs, Peter Jurg

Publication date: 29 June 1993

Published in: International Journal of Game Theory (Search for Journal in Brave)

zbMATH Keywords

bimatrix gamelabeling technique\(\varepsilon\)-optimal in nonnegative direction\(k\)-guaranteeing pointsweak determinateness

Mathematics Subject Classification ID

2-person games (91A05)

Related Items (3)

On `informationally robust equilibria' for bimatrix games ⋮ SIMPLE EQUILIBRIA IN SEMI-INFINITE GAMES ⋮ Characterizing properties of approximate solutions for optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Non-cooperative games
• Generalization of a theorem by v. Neumann concerning zero sum two person games
• Nash Equilibria for Noncooperative n-Person Games in Normal Form

This page was built for publication: On the determinateness of semi-infinite bimatrix games