Abstract
We consider multistage bimatrix games with pairwise interactions. On the first stage players chose their neighbours and formed a network. On the later stages bimatrix games between neighbours by network take places. As a solution consider the τ-value (Tijs, 1987). Earlier we calculated coefficient λ of τ-value in case of two-stage game. Now we consider a general case of one-stage game with any players and any number of links. We assumed followings: N is set of players, N ≥ 2 and any type of network g. It is also assumed, that there are not necessarily paths between every pair of vertices. We will consider conditions for time-consistency of τ-value in two-stage game.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
