This paper provides a simple characterization of potential games in terms of path independence. Using this characterization we propose an algorithm to determine if a finite game is potential or not. We define the storage requirement for our algorithm and provide its upper bound. The number of equations required in this algorithm is lower or equal to the number obtained in the algorithms propose...

Binomial trees are very popular in both theory and applications of option pricing. As they often suffer from an irregular convergence behavior, improving this is an important task. We build upon a new version of the Edgeworth expansion for lattice models to construct new and quickly converging binomial schemes with a particular application to barrier options.

This is a good place to point out that these are only (approximating) , and not full truth. models Truth is not a model. A model, by definition, is an approximation (and not truth). In fact, out of a few million coin flips, one or more coins will remain standing on edge – that is truth. The binomial model does not allow such reality. The idea is more easily understood for the outcomes “dead" or...

In this expository paper we illustrate the generality of game theoretic probability protocols of Shafer and Vovk (2001) in finite-horizon discrete games. By restricting ourselves to finite-horizon discrete games, we can explicitly describe how discrete distributions with finite support and the discrete pricing formulas, such as the Cox-Ross-Rubinstein formula, are naturally derived from game-th...

In this work, we present a model to value capacity investment decisions based on real options. In the problem considered we incorporate partial reversibility by letting the firm reverse its capital investment at a cost, both fully or partially. The standard RO approach considers the stochastic variable to be normally distributed and then approximated by a binomial distribution, resulting in a b...