Related papers: Optimal placement of a small order in a diffusive …
We consider a continuous-review inventory system in which the setup cost of each order is a general function of the order quantity and the demand process is modeled as a Brownian motion with a positive drift. Assuming the holding and…
We propose a static equilibrium model for limit order book where profit-maximizing investors receive an information signal regarding the liquidation value of the asset and execute via a competitive dealer with random initial inventory, who…
We introduce and study a simple model of a limit order-driven market. Traders in this model can either trade at the market price or place a limit order, i.e. an instruction to buy (sell) a certain amount of the stock if its price falls…
In this paper we consider multiple constrained resource allocation problems, where the constraints can be specified by formulating activity dependency restrictions or by using game-theoretic models. All the problems are focused on generic…
We study the optimal control of storage which is used for arbitrage, i.e. for buying a commodity when it is cheap and selling it when it is expensive. Our particular concern is with the management of energy systems, although the results are…
We introduce and study a class of optimization problems we coin replenishment problems with fixed turnover times: a very natural model that has received little attention in the literature. Nodes with capacity for storing a certain commodity…
Management of the portfolios containing low liquidity assets is a tedious problem. The buyer proposes the price that can differ greatly from the paper value estimated by the seller, the seller, on the other hand, can not liquidate his…
We present an $n\Delta^{O(k^2)}$ time algorithm to obtain an optimal solution for $1$-dimensional cutting stock problem: the bin packing problem of packing $n$ items onto unit capacity bins under the restriction that the number of item…
The Bin Packing Problem is one of the most important optimization problems. In recent years, due to its NP-hard nature, several approximation algorithms have been presented. It is proved that the best algorithm for the Bin Packing Problem…
We consider an optimal investment problem to maximize expected utility of the terminal wealth, in an illiquid market with search frictions and transaction costs. In the market model, an investor's attempt of transaction is successful only…
This paper analyzes a problem of optimal static hedging using derivatives in incomplete markets. The investor is assumed to have a risk exposure to two underlying assets. The hedging instruments are vanilla options written on a single…
In this paper, we consider a discrete-time stochastic control problem with uncertain initial and target states. We first discuss the connection between optimal transport and stochastic control problems of this form. Next, we formulate a…
We propose an algorithm to calculate the exact solution for utility optimization problems on finite state spaces under a class of non-differentiable preferences. We prove that optimal strategies must lie on a discrete grid in the plane, and…
We investigate whether the bid/ask queue imbalance in a limit order book (LOB) provides significant predictive power for the direction of the next mid-price movement. We consider this question both in the context of a simple binary…
Optimising queries in real-world situations under imperfect conditions is still a problem that has not been fully solved. We consider finding the optimal order in which to execute a given set of selection operators under partial ignorance…
We study the dynamics of the limit order book of liquid stocks after experiencing large intra-day price changes. In the data we find large variations in several microscopical measures, e.g., the volatility the bid-ask spread, the bid-ask…
We study the problem of selling an asset near its ultimate maximum in the minimax setting. The regret-based notion of a perfect stopping time is introduced. A perfect stopping time is uniquely characterized by its optimality properties and…
We consider the problem of the optimal trading strategy in the presence of linear costs, and with a strict cap on the allowed position in the market. Using Bellman's backward recursion method, we show that the optimal strategy is to switch…
Motivated by a zero-intelligence approach, the aim of this paper is to connect the microscopic (discrete price and volume), mesoscopic (discrete price and continuous volume) and macroscopic (continuous price and volume) frameworks for the…
An unconventional approach for optimal stopping under model ambiguity is introduced. Besides ambiguity itself, we take into account how ambiguity-averse an agent is. This inclusion of ambiguity attitude, via an $\alpha$-maxmin nonlinear…