Skip to main content
Swap Used Books - Buy New Books at Great Prices!
How To Swap Books
Sign Up
Search 
Kiosk
PBS Market (New Books)
Book Browser
Advanced Search
Books Posted Today
Member Book Reviews
Award Winning Books
NYT Best Sellers
Amazon Best Sellers
Most Traveled Copies
Club Wish List
Login
Community
Discussion Forums
Book Lists
Blog
Donations
Box-O-Books
Maps
The Eclectic Pen
Fun Stuff
Top 100
Pulse of PBS
Spread The Word
Photo Gallery
Recipes
Club Tag Cloud
Member Testimonials
Help Center
Kiosk
PBS Market (New Books)
Go Shopping
Buy Credits
Buy PBS Money
Upgrade Membership
Gift Certificates
Transfer Credits
Search -
Computational Models of Games (ACM Distinguished Dissertation)
Computational Models of Games - ACM Distinguished Dissertation
Author:
Modeling games provides a deeper understanding of computational models in general. Researchers in artificial intelligence have looked to chess as a model of thinking that can be automated while those in distributed computing and cryptography need models that reflect the competitive nature of distributed and cryptographic protocols. Computa... more »describes a model of two person games - called a probabilistic game automaton - that unifies other important models that have been developed to reflect the game-like properties of computational problems. It also covers interesting models of games not previously studied (introducing games against unknown nature, for example) and proves new results on time bounded game automata, space bounded game automata with complete information, and space bounded game automata with partial information. By incorporating the three important features of randomness, secrecy, and limited power for the players, the probabilistic game automaton models in a natural way many problems that computer scientists confront and provides insight into their complexity. It generalizes computational models such as the alternating Turing machines of Chandra, Kozen, and Stockmeyer, Papadimitriou's games against nature, the Arthur-Merlin games of Babai, and the interactive proof systems of Goldwasser, Micali, and Rackoff. Anne Condon received her doctorate from The University of Washington and is Assistant Professor at The University of Wisconsin Computational Models of Games is a 1988 ACM Distinguished Dissertation
Author:
Modeling games provides a deeper understanding of computational models in general. Researchers in artificial intelligence have looked to chess as a model of thinking that can be automated while those in distributed computing and cryptography need models that reflect the competitive nature of distributed and cryptographic protocols. Computa... more »describes a model of two person games - called a probabilistic game automaton - that unifies other important models that have been developed to reflect the game-like properties of computational problems. It also covers interesting models of games not previously studied (introducing games against unknown nature, for example) and proves new results on time bounded game automata, space bounded game automata with complete information, and space bounded game automata with partial information. By incorporating the three important features of randomness, secrecy, and limited power for the players, the probabilistic game automaton models in a natural way many problems that computer scientists confront and provides insight into their complexity. It generalizes computational models such as the alternating Turing machines of Chandra, Kozen, and Stockmeyer, Papadimitriou's games against nature, the Arthur-Merlin games of Babai, and the interactive proof systems of Goldwasser, Micali, and Rackoff. Anne Condon received her doctorate from The University of Washington and is Assistant Professor at The University of Wisconsin Computational Models of Games is a 1988 ACM Distinguished Dissertation
ISBN-13: 9780262031523
ISBN-10: 0262031523
Publication Date: 8/11/1989
Pages: 147
Rating: ?
ISBN-10: 0262031523
Publication Date: 8/11/1989
Pages: 147
Rating: ?
0 stars, based on 0 rating
