HomeGroupsTalkZeitgeist
Hide this

Results from Google Books

Click on a thumbnail to go to Google Books.

Computational Models of Games (ACM…
Loading...

Computational Models of Games (ACM Distinguished Dissertation)

by Anne Condon

MembersReviewsPopularityAverage ratingConversations
1None3,689,591NoneNone
Recently added bypeterdmark

None.

None
Loading...

Sign up for LibraryThing to find out whether you'll like this book.

No current Talk conversations about this book.

No reviews
no reviews | add a review
You must log in to edit Common Knowledge data.
For more help see the Common Knowledge help page.
Series (with order)
Canonical title
Original title
Alternative titles
Original publication date
People/Characters
Important places
Important events
Related movies
Awards and honors
Epigraph
Dedication
First words
Quotations
Last words
Disambiguation notice
Publisher's editors
Blurbers
Publisher series
Original language

References to this work on external resources.

Wikipedia in English

None

Book description
Haiku summary

Amazon.com Product Description (ISBN 0262031523, Hardcover)

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.

Computational Models of Games 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

(retrieved from Amazon Thu, 12 Mar 2015 18:16:45 -0400)

No library descriptions found.

Quick Links

Swap Ebooks Audio
1 pay

Popular covers

Rating

Average: No ratings.

Is this you?

Become a LibraryThing Author.

 

You are using the new servers! | About | Privacy/Terms | Help/FAQs | Blog | Store | APIs | TinyCat | Legacy Libraries | Early Reviewers | Common Knowledge | 117,114,496 books! | Top bar: Always visible