Before revision: We study an extension of optimal transport techniques to stationary Markov chains from a computational perspective.
After revision: We study the optimal transport problem for pairs of stationary finite-state Markov chains, with an emphasis on the computation of optimal transition couplings. Transition couplings are a constrained family of transport plans that capture the dynamics of Markov chains from a computational perspective.