Mauricio Junca

h-index7
2papers

2 Papers

TRAug 24, 2011
Optimal execution strategy in the presence of permanent price impact and fixed transaction cost

Mauricio Junca

We study a single risky financial asset model subject to price impact and transaction cost over an infinite horizon. An investor needs to execute a long position in the asset affecting the price of the asset and possibly incurring in fixed transaction cost. The objective is to maximize the discounted revenue obtained by this transaction. This problem is formulated first as an impulse control problem and we characterize the value function using the viscosity solutions framework. We also analyze the case where there is no transaction cost and how this formulation relates with a singular control problem. A viscosity solution characterization is provided in this case as well. We also establish a connection between both formulations with zero fixed transaction cost. Numerical examples with different types of price impact conclude the discussion.

LGMay 27, 2025Code
Apprenticeship learning with prior beliefs using inverse optimization

Mauricio Junca, Esteban Leiva

The relationship between inverse reinforcement learning (IRL) and inverse optimization (IO) for Markov decision processes (MDPs) has been relatively underexplored in the literature, despite addressing the same problem. In this work, we revisit the relationship between the IO framework for MDPs, IRL, and apprenticeship learning (AL). We incorporate prior beliefs on the structure of the cost function into the IRL and AL problems, and demonstrate that the convex-analytic view of the AL formalism (Kamoutsi et al., 2021) emerges as a relaxation of our framework. Notably, the AL formalism is a special case in our framework when the regularization term is absent. Focusing on the suboptimal expert setting, we formulate the AL problem as a regularized min-max problem. The regularizer plays a key role in addressing the ill-posedness of IRL by guiding the search for plausible cost functions. To solve the resulting regularized-convex-concave-min-max problem, we use stochastic mirror descent (SMD) and establish convergence bounds for the proposed method. Numerical experiments highlight the critical role of regularization in learning cost vectors and apprentice policies.