Please use this identifier to cite or link to this item: http://hdl.handle.net/10071/26394
Author(s): Ferreira, M. A. M.
Matos, M. C.
Editor: Manuel Alberto M. Ferreira
Date: 2020
Title: Implementing and solving games with best payoff method
Volume: 2
Book title/volume: Theory and practice of mathematics and computer science
Pages: 61 - 69
Reference: Ferreira, M. A. M., & Matos, M. C. (2020). Implementing and solving games with best payoff method. EM Manuel Alberto M. Ferreira (Ed.).Theory and practice of mathematics and computer science (2). Book Publisher International. 10.9734/bpi/tpmcs/v2
ISBN: 978-93-90206-64-3
DOI (Digital Object Identifier): 10.9734/bpi/tpmcs/v2
Keywords: Best payoff method
Perfect information game
Imperfect information game
Selection process game
Abstract: It is our intention, in this chapter, to propose and discuss the Best Payoff Method, a new method to resolve games. This is made exemplifying the application of the method to a pay raise voting game, that is a perfect information sequential game, without having yet formulated it, and then deploying the algorithm for its implementation. In the next examples we consider an imperfect information game and a game with random characteristics. We finish confronting the equilibrium concepts mentioned in this work: Subgame Perfect Nash Equilibrium, Nash Equilibrium, and Best Payoff Equilibrium through the formulation of some conjectures, and with a short conclusions section.
Peerreviewed: yes
Access type: Open Access
Appears in Collections:ISTAR-CLI - Capítulos de livros internacionais

Files in This Item:
File SizeFormat 
bookPart_74457.pdf340,87 kBAdobe PDFView/Open


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpaceOrkut
Formato BibTex mendeley Endnote Logotipo do DeGóis Logotipo do Orcid 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.