Extending computational game theory : simultaneity, multiple agents, chance and metareasoning /

Abstract: "This thesis extends the class of games that can be solved efficiently by computer play. Previous research has focused on two- player zero-sum games of perfect information without chance occurrences. However, computer analysis and control of strategic interactions (e.g., in planning,...

Full description

Bibliographic Details
Main Author: Bodkin, Ronald J
Format: Thesis Book
Language:English
Published: Cambridge, Mass. : Massachusetts Institute of Technology. Laboratory for Computer Science, [1994]
Series:Technical report (Massachusetts Institute of Technology. Laboratory for Computer Science) ; MIT/LCS/TR-634
Subjects:

Internet

Stanford University

Holdings details from Stanford University
Call Number: 135025