Abstract: "We examine search algorithms in games with incomplete information. We proceed by adopting the standard game theoretic framework of zero-sum two-player games, introducing a reduced form of incomplete information games in which equilibrium point strategies can be identified, and giving...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Frank, Ian (VerfasserIn), Basin, David (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Edinburgh 1996
Schriftenreihe:	University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 780
Schlagworte:	Applied statistics, operational research Bionics and artificial intelligence Datenverarbeitung Computer games Contract bridge > Data processing Game theory Heuristic programming
Zusammenfassung:	Abstract: "We examine search algorithms in games with incomplete information. We proceed by adopting the standard game theoretic framework of zero-sum two-player games, introducing a reduced form of incomplete information games in which equilibrium point strategies can be identified, and giving an algorithm that finds such strategies. We apply our formalisation to the game of Bridge, for which the reduced form corresponds to the typical model analysed in expert texts. In particular, we examine search algorithms for Bridge that have been proposed by other researchers, countering the optimistic suggestion that the incomplete information in the game can be tackled by an algorithm which considers some statistically significant subset of the possible worlds (card distributions). We use our model to pinpoint why, both in theory and practice, such approaches must lead to suboptimal performance and we generalise the reasons for this failure into two specific and distinct problems. We illustrate these problems and our solution with simple game trees and with actual play situations from Bridge itself."
Beschreibung:	28 S.