Learning to bid in revenue-maximizing auctions

We consider the problem of the optimization of bidding strategies in prior-dependent revenue-maximizing auctions, when the seller fixes the reserve prices based on the bid distributions. Our study is done in the setting where one bidder is strategic. Using a variational approach, we study the complexity of the original objective and we introduce a relaxation of the objective functional in order to use gradient descent methods. Our approach is simple, general and can be applied to various value distributions and revenue-maximizing mechanisms. The new strategies we derive yield massive uplifts compared to the traditional truthfully bidding strategy

Computation of option greeks under hybrid stochastic volatility models via Malliavin calculus

This study introduces computation of option sensitivities (Greeks) using the Malliavin calculus under the assumption that the underlying asset and interest rate both evolve from a stochastic volatility model and a stochastic interest rate model, respectively. Therefore, it integrates the recent developments in the Malliavin calculus for the computation of Greeks: Delta, Vega, and Rho and it extends the method slightly. The main results show that Malliavin calculus allows a running Monte Carlo (MC) algorithm to present numerical implementations and to illustrate its effectiveness. The main advantage of this method is that once the algorithms are constructed, they can be used for numerous types of option, even if their payoff functions are not differentiable.Comment: Published at https://doi.org/10.15559/18-VMSTA100 in the Modern Stochastics: Theory and Applications (https://www.i-journals.org/vtxpp/VMSTA) by VTeX (http://www.vtex.lt/