Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE (www.oxfordhandbooks.com). © Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a title in Oxford Handbooks Online for personal use (for details see Privacy Policy and Legal Notice).

date: 17 September 2019

Abstract and Keywords

Game theory aims to understand situations in which decision-makers interact strategically. Chess is an example, as are firms competing for business, politicians competing for votes, animals fighting over prey, bidders competing in auctions, threats and punishments in long-term relationships, and so on. In such situations, the outcome depends on what the parties do jointly. Decision-makers may be people, organizations, animals, or even genes. In this chapter, the authors review fundamental notions of game theory and their application to philosophy of science. In particular, Section 1 looks at games of complete information through normal and extensive form representations, introduce the notion of Nash equilibrium and its refinements. Section 2 touches on epistemic foundations and correlated equilibrium, and Section 3 examines repeated games and their importance for the analysis of altruism and cooperation. Section 4 deals with evolutionary game theory.

Keywords: game theory, Nash equilibrium, perfect information, epistemic foundation, awareness, correlated equilibrium, evolutionary, genes, cooperation

Access to the complete content on Oxford Handbooks Online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can''t find the answer there, please contact us.