Solvability of Two-Player Game Forms with Infinite Sets of Strategies

DOI10.1287/MOOR.20.1.213MaRDI QIDQ4835395zbMATH OpenOpenAlexFDO

Authors Joseph M. Abdou

Publication date 14 June 1995

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.20.1.213

zbMATH Keywords

game formgames with perfect informationinfinitely repeated game formsNash equilibriumtightness

Mathematics Subject Classification ID

2-person games (91A05) Multistage and repeated games (91A20)

Recommendations

• On necessary and sufficient conditions for solvability of game forms.
• Acyclic, or totally tight, two-person game forms: characterization and main properties
• Tight and effectively rectangular game forms: A Nash solvable class
• scientific article; zbMATH DE number 4095249
• Rectangularity and tightness: A normal form characterization of perfect information extensive game forms

Cited in

(10)

• Tight and effectively rectangular game forms: A Nash solvable class
• On the invariance of solutions of finite games
• Playing with mixed strategies on infinite sets
• On necessary and sufficient conditions for solvability of game forms.
• On the IENBR-solvability of two-person finite games
• Nash consistent representation of constitutions: A reaction to the Gibbard paradox.
• Total tightness implies Nash-solvability for three-person game forms
• scientific article; zbMATH DE number 1051712 (Why is no real title available?)
• Solving Infinite Games in the Baire Space
• Acyclic, or totally tight, two-person game forms: characterization and main properties

This page was built for publication: Solvability of Two-Player Game Forms with Infinite Sets of Strategies

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