Blackwell Games

Blackwell games are infinite games of imperfect information. The two players simultaneously make their moves and are then informed of each other's moves. Payoff is determined by a Borel measurable function f on the set of possible resulting sequences of moves. A standard result in Game Theory i...

Full description

Saved in:
Bibliographic Details
Published in:Lecture notes-monograph series 1996-01, Vol.30, p.369-390
Main Author: Marco R. Vervoort
Format: Article
Language:English
Subjects:
Chess
Determinacy
Game theory
Games
Imperfect information
Mathematical functions
Mixed strategy
Optimal strategies
Perfect information
Probability distributions
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Blackwell games are infinite games of imperfect information. The two players simultaneously make their moves and are then informed of each other's moves. Payoff is determined by a Borel measurable function f on the set of possible resulting sequences of moves. A standard result in Game Theory is that finite games of this type are determined. Blackwell proved that infinite games are determined, but only for the cases where the payoff function is the indicator function of an open or Gδset [2, 3]. For games of perfect information, determinacy has been proven for games of arbitrary Borel complexity [6, 7, 8]. In this paper I prove the determinacy of Blackwell games over a$G_{\delta \sigma}$set, in a manner similar to Davis' proof of determinacy of games of$G_{\delta \sigma}$complexity of perfect information [5]. There is also extensive literature about the consequences of assuming AD, the axiom that all such games of perfect information are determined [9, 11]. In the final section of this paper I formulate an analogous axiom for games of imperfect information, and explore some of the consequences of this axiom.
ISSN:0749-2170