Abstract
The paper explores the properties of multistage games with perfect information, in which (unlike the classic Kuhnian definition) the conditional coalition partition at any vertex is determined by a chance move and remains unchanged until the random process repeats at the next vertex. A new value for such a game is proposed in terms of a PMS-vector. It is computed by backward induction using conditional partition and transition in the vertices. An illustrative example is provided.
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
