Trade execution games in a Markovian environment

By Masamitsu OHNISHI, Makoto SHIMOSHIMIZU

Rating

1571
Battle Count: 163

Relevance

9/10
Highly relevant for developing optimal execution strategies in the presence of other large traders and market impact

Implementation Complexity

7/10
Requires advanced mathematical knowledge and implementation of dynamic programming algorithms

Reproducibility

3/5
Theoretical framework and proofs are provided, but no code is shared. Numerical experiments can be reproduced with given parameter values.

About this paper

Methodology: Markov game model. Problem types: Algorithmic Execution, Game Theory, Optimization.

The interactive Everscope explorer (charts, battles, favorites) loads below.