Abstract
Multistage game G with bimatrix game Γ played on each stage is considered. The definitions of outcome, path in tree-graph, history, beam of rank k, information sets, the alternatives are introduce. The new class of situations based on K – s stage punishment, where K is the number of stages in G, is introduced. It is proved that under some very week conditions they form a Nash equilibrium. Some numerical examples of bimatrix games are considered.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
