New ML method detects incomplete bid-rigging cartels.
arXiv research
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.
Trend · papers per month
Deep learning detects bid-rigging cartels with high accuracy.
RIG extends IG to Riemannian manifolds for explainable AI.
Let $x:M\to\Bm$ be the canonical injection of a Null Hypersurface in a semi-Riemannian manifold . A rigging for is a vector field defined on some open set of containing such that for each . Such a vector field induces a null rigging .…
Rigging technique introduced in \cite{bi0} is a convenient way to address the study of null hypersurfaces. It offers in addition the extra benefit of inducing a Riemannian structure on the null hypersurface which is used to study geometric and topological properties on it. In this paper we develop this technique showin…
Enhances Koopman operator estimation with intrinsic observables in RKHS.
Study null hypersurfaces in Lorentzian manifolds, proving Riemannian flow structure.
The author discusses in some detail the old definitions of the curvature tensors for rigged metrized distributions on manifolds given by Schouten, Wagner, and Solov'ev. To calculate the Solov'ev sectional and Ricci curvatures for homogeneous sub-Riemannian manifolds, the author suggests to use in some cases special rig…
Unified approach to conformal and modular invariants on surfaces.
Using the classification of transitive groups we classify indecomposable quandles of size <36. This classification is available in Rig, a GAP package for computations related to racks and quandles. As an application, the list of all indecomposable quandles of size <36 not of type D is computed.
We present a construction of a 2-Hilbert space of sections of a bundle gerbe, a suitable candidate for a prequantum 2-Hilbert space in higher geometric quantisation. We introduce a direct sum on the morphism categories in the 2-category of bundle gerbes and show that these categories are cartesian monoidal and abelian.…
We consider a class of auctions (Lowest Unique Bid Auctions) that have achieved a considerable success on the Internet. Bids are made in cents (of euro) and every bidder can bid as many numbers as she wants. The lowest unique bid wins the auction. Every bid has a fixed cost, and once a participant makes a bid, she gets…
A new relaxed framework for pricing illiquid derivatives using bid-ask spreads.
Algorithm learns to bid in auctions with shilling, masking real bids.
Real-time advertising allows advertisers to bid for each impression for a visiting user. To optimize specific goals such as maximizing revenue and return on investment (ROI) led by ad placements, advertisers not only need to estimate the relevance between the ads and user's interests, but most importantly require a str…
BiCB combines traffic prediction and bidding optimization for live advertising.
This paper describes how to define and work with differential equations in the abstract setting of tangent categories. The key notion is that of a curve object which is, for differential geometry, the structural analogue of a natural number object. A curve object is a preinitial object for dynamical systems; dynamical …
Develops a new bidding system to maximize advertiser profit.
Optimizes bidding strategy for Maker Protocol auctions.
Optimizes bidding strategies for LinkedIn ads across multiple platforms.
This paper tackles optimal bidding strategies in adversarial first-price auctions.
New bid shading algorithm reduces costs by 55%.
Models of auctions or tendering processes are introduced. In every round of bidding the players select their bid from a probability distribution and whenever a bid is unsuccessful, it is discarded and replaced. For simple models, the probability distributions evolve to a stationary power law with the exponent dependent…
Deep network optimizes ad bidding for first-price auctions.
Proposes a virtual bidding strategy for electricity markets using stochastic control.
Optimizes RTB bidding without exploration, improving performance under various budgets.
In this paper a finite discrete time market with an arbitrary state space and bid-ask spreads is considered. The notion of an equivalent bid-ask martingale measure (EBAMM) is introduced and the fundamental theorem of asset pricing is proved using (EBAMM) as an equivalent condition for no-arbitrage. The Cox-Ross-Rubinst…
Taobao, as the largest online retail platform in the world, provides billions of online display advertising impressions for millions of advertisers every day. For commercial purposes, the advertisers bid for specific spots and target crowds to compete for business traffic. The platform chooses the most suitable ads to …
Model predicts bid and ask price dynamics with spread-dependent intensities.
Paper uses reinforcement learning to optimize bid-ask spreads in OTC markets.
In programmatic advertising, ad slots are usually sold using second-price (SP) auctions in real-time. The highest bidding advertiser wins but pays only the second-highest bid (known as the winning price). In SP, for a single item, the dominant strategy of each bidder is to bid the true value from the bidder's perspecti…
This paper improves bidding price prediction for ancillary services markets, boosting revenues.
This work optimizes bid strategies for online auctions using measure-valued optimization.
Predicting click and conversion probabilities when bidding on ad exchanges is at the core of the programmatic advertising industry. Two separated lines of previous works respectively address i) the prediction of user conversion probability and ii) the attribution of these conversions to advertising events (such as clic…
We introduce, in continuous time, an axiomatic approach to assign to any financial position a dynamic ask (resp. bid) price process. Taking into account both transaction costs and liquidity risk this leads to the convexity (resp. concavity) of the ask (resp. bid) price. Time consistency is a crucial property for dynami…
The participants of the electricity market concern very much the market price evolution. Various technologies have been developed for price forecast. SVM (Support Vector Machine) has shown its good performance in market price forecast. Two approaches for forming the market bidding strategies based on SVM are proposed. …
Grid-scale batteries' bid patterns in price uncertainty markets
Paper proposes a decentralized payment clearing system using blockchain and optimal bidding strategies.
Optimal bidding strategy for multi-platform ad auctions under budget constraints.
We explore nature of price formation in financial markets and develop a theory of bid and ask price dynamics in which the two prices form due to quantum-chaotic interaction between buy and sell orders. In this model bid and ask prices are represented by eigenvalues of a 2x2 price operator corresponding to 'bid' and 'as…
Real-time bidding (RTB) systems, which utilize auctions to allocate user impressions to competing advertisers, continue to enjoy success in digital advertising. Assessing the effectiveness of such advertising remains a challenge in research and practice. This paper proposes a new approach to perform causal inference on…
Microstructure of market dynamics is studied through analysis of tick price data. Linear trend is introduced as a tool for such analysis. Trend arbitrage inequality is developed and tested. The inequality sets limiting relationship between trend, bid-ask spread, market reaction and average update frequency of price inf…
Develops a model for bid and ask prices using stochastic control.
Improved learning algorithm for first-price auctions reduces regret significantly.
A new method calculates implied volatilities without using option prices.
In this paper we present a theoretical framework for determining dynamic ask and bid prices of derivatives using the theory of dynamic coherent acceptability indices in discrete time. We prove a version of the First Fundamental Theorem of Asset Pricing using the dynamic coherent risk measures. We introduce the dynamic …
In recent years, RTB(Real Time Bidding) becomes a popular online advertisement trading method. During the auction, each DSP(Demand Side Platform) is supposed to evaluate current opportunity and respond with an ad and corresponding bid price. It's essential for DSP to find an optimal ad selection and bid price determina…
Study proposes a machine learning method for bid shading in first-price auctions.