Biform game: Reflection as a stochastic programming problem

In this paper we examine the biform games modeling framework. More specifically, we recast biform games as two‐stage stochastic programming with recourse. The two‐stage stochastic programming view of biform games is demonstrated in this paper on an example from Brandenburger and Stuart (2007) regarding a coordination game. We claim that our stochastic programming format for biform games allows for a well established mathematical methodology to enrich the modeling options when applied to biform competitive and cooperative game options.