Jump to ContentJump to Main Navigation
Playing for RealGame Theory$
Users without a subscription are not able to see the full content.

Ken Binmore

Print publication date: 2007

Print ISBN-13: 9780195300574

Published to Oxford Scholarship Online: May 2007

DOI: 10.1093/acprof:oso/9780195300574.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 13 October 2019

 Knowing What to Believe

 Knowing What to Believe

Chapter:
(p.431) 15 Knowing What to Believe
Source:
Playing for Real
Author(s):

Ken Binmore (Contributor Webpage)

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780195300574.003.0015

This chapter describes John Harsanyi's theory of so-called games of incomplete information using Poker as a motivating example. The chapter begins by analyzing a simplified version of Von Neumann's second Poker model. The general theory of incomplete information is then described. Russian Roulette and Cournot Duopoly with incomplete information about costs are used as examples. Harsanyi's purification of mixed strategies is briefly described. The finitely repeated Prisoner's Dilemma, in which the number of repetitions is not common knowledge, is given as an example with incomplete information about the rules of a game.

Keywords:   incomplete information, John Harsanyi, bluffing, Von Neumann's Poker model, Bayes-Nash equilibrium, Bayesian equilibrium, Russian Roulette, duopoly, agreeing to disagree, purification

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .