A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
New theory shows perishable goods markets are more stable and efficient.
We study an infinite-horizon optimal investment, consumption and insurance problem for an economic agent who consumes a perishable and a durable good. The agent trades in a risk-free asset, a risky asset, and a durable good whose price follows a correlated diffusion, while the stock of the durable good depreciates dete…
Algorithm allocates perishable resources online to minimize envy and inefficiency.
Study finds inventory inaccuracies are linked to store activity and product perishability.
Model analyzes competitive pricing strategies in large markets of perishable products.
Generalising the idea of the classical EM algorithm that is widely used for computing maximum likelihood estimates, we propose an EM-Control (EM-C) algorithm for solving multi-period finite time horizon stochastic control problems. The new algorithm sequentially updates the control policies in each time period using Mo…
Paper applies RL to optimize inventory management across multiple products and nodes.
Most sales applications are characterized by competition and limited demand information. For successful pricing strategies, frequent price adjustments as well as anticipation of market dynamics are crucial. Both effects are challenging as competitive markets are complex and computations of optimized pricing adjustments…
Standard micro-economics concentrate on the description of markets but is seldom interested in production. Several economists discussed the concept of a firm, as opposed to an open labour market where entrepreneurs would recrute workers on the occasion of each business opportunity. Coase \cite{Coase} is one of them, wh…
Optimistic pricing algorithm handles online dynamic pricing with censored demand.
MaxCOSD algorithm tackles non-i.i.d. demands and stateful dynamics in online inventory control.
Study optimizes pricing under uncertainty and capacity constraints.
In financial markets valuable information is rarely circulated homogeneously, because of time required for information to spread. However, advances in communication technology means that the 'lifetime' of important information is typically short. Hence, viewed as a tradable asset, information shares the characteristics…
Approximate linear programs (ALPs) are well-known models based on value function approximations (VFAs) to obtain policies and lower bounds on the optimal policy cost of discounted-cost Markov decision processes (MDPs). Formulating an ALP requires (i) basis functions, the linear combination of which defines the VFA, and…
We consider a firm that sells a large number of products to its customers in an online fashion. Each product is described by a high dimensional feature vector, and the market value of a product is assumed to be linear in the values of its features. Parameters of the valuation model are unknown and can change over time.…
We prove the Kobayashi-Hitchin correspondence between good wild harmonic bundles and polystable good filtered -flat bundles satisfying a vanishing condition. We also study the correspondence for good wild harmonic bundles with the homogeneity with respect to a group action, which is expected to provide another way t…
The paper defines conditions for good involutions in generalized Alexander quandles.
3D good continuation model explains stereo vision using neurogeometry.
We study convex risk measures describing the upper and lower bounds of a good deal bound, which is a subinterval of a no-arbitrage pricing bound. We call such a convex risk measure a good deal valuation and give a set of equivalent conditions for its existence in terms of market. A good deal valuation is characterized …
Good atlases are defined for effective orbifolds, and a spark complex is constructed on each good atlas. It is proved that this process is 2-functorial with compatible systems playing as morphisms between good atlases, and that the spark character 2-functor factors through this 2-functor.
The study describes good involutions in quandles and Alexander quandles.
The study proves symplectic quandles cannot have good involutions.
This paper studies an environment of simultaneous, separate, first-price auctions for complementary goods. Agents observe private values of each good before making bids, and the complementarity between goods is explicitly incorporated in their utility. For simplicity, a model is presented with two first-price auctions …
We introduce a system of kinetic equations describing an exchange market consisting of two populations of agents (dealers and speculators) expressing the same preferences for two goods, but applying different strategies in their exchanges. We describe the trading of the goods by means of some fundamental rules in price…
We study a notion of good-deal hedging, that corresponds to good-deal valuation for generalized good-deal constraints. Under model uncertainty about the market prices of risk of hedging assets, a robust approach leads to a reduction or even elimination of a speculative component in good-deal hedging, which is shown to …
FF algorithm uses goodness as a likelihood-ratio test for scalar normalization.
Paper tackles good arm identification in stochastic bandits.
FF algorithm uses goodness as a measure of input quality, derived from likelihood-ratio tests.
Classifies good involutions in conjugation subquandles and racks.
We prove that a connected 2-dimensional orbifold with finitely generated and infinite orbifold fundamental group is good. We also describe all the good 2-dimensional orbifolds with finite orbifold fundamental groups
We shall provide in this paper good deal pricing bounds for contingent claims induced by the shortfall risk with some loss function. Assumptions we impose on loss functions and contingent claims are very mild. We prove that the upper and lower bounds of good deal pricing bounds are expressed by convex risk measures on …
A good cover in R^d is a collection of open contractible sets in R^d such that the intersection of any subcollection is either contractible or empty. Motivated by an analogy with convex sets, intersection patterns of good covers were studied intensively. Our main result is that intersection patterns of good covers are …
Study lenient regret and good-action identification in Gaussian process bandits.
New algorithms find all ε-good arms in stochastic bandits.
New robustness test for kernel goodness-of-fit tests.
We study robust notions of good-deal hedging and valuation under combined uncertainty about the drifts and volatilities of asset prices. Good-deal bounds are determined by a subset of risk-neutral pricing measures such that not only opportunities for arbitrage are excluded but also deals that are too good, by restricti…
We investigate the structure of good deal bounds, which are subintervals of a no-arbitrage pricing bound, for financial market models with convex constraints as an extension of Arai and Fukasawa (2014). The upper and lower bounds of a good deal bound are naturally described by a convex risk measure. We call such a risk…
Paper extends theorem on covering spaces and Jordan curves.
The purpose of this paper is to produce restrictions on fundamental groups of manifolds admitting good complexifications by proving the following Cheeger-Gromoll type splitting theorem: Any closed manifold admitting a good complexification has a finite-sheeted regular covering such that admits a fiber b…
A monopolist sells goods with possibly a characteristic consumers dislike (for instance, he sells random goods to risk averse agents), which does not affect the production costs. We investigate the question whether using undesirable goods is profitable to the seller. We prove that in general this may be the case, depen…
APGAI identifies good arms anytime with fixed budget.
We show that every good boundary link with a pair of derivative links on a Seifert surface satisfying a homotopically trivial plus assumption is freely slice. This subsumes all previously known methods for freely slicing good boundary links with two or more components, and provides new freely slice links.
Defines invariants for reflection groups and connects them to Frobenius structures.
We discuss construction of coverings of the unit ball of a finite dimensional Banach space. The well known technique of comparing volumes gives upper and lower bounds on covering numbers. This technique does not provide a construction of good coverings. Here we apply incoherent dictionaries for construction of good cov…
This paper extends the Good Covering Theorem and Jordan Curve Theorem for proximal Alexandrov spaces.
Deep learning model reduces food waste by stabilizing online food delivery supply chains.
This study calculates the maximum error of a famous estimation method.
Paper defines invariants for elliptic Weyl groups and connects them to Frobenius structures.