ABSTRACT

Game tree modeling on VMK encodings with a sequent description logic is presented based on computable partition functions on generic game model diagrams. The encoding allows us to reach newer computability areas on game trees based on agent game trees on VMK game models. Novel payoff criteria on game trees and game topologies are obtained. Epistemic accessibility is addressed on game model diagrams payoff computations.