Research
On-device research index

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.

168,695 papers · 148 categories

Trend · papers per month

235469704938 · Jun 202019922001200920172026
48 results for Real Time Bidding

Optimizes RTB bidding without exploration, improving performance under various budgets.

problem Lack of clear evaluation and generalization issues in RTB systems.
method Maximum entropy principle and conditional independence structures to train a model that generalizes to unseen budget conditions.
result Significantly improved performance under various budget settings compared to baselines.

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…

2020-01-18abs ↗pdf ↗

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…

2019-08-22abs ↗pdf ↗

Proposes a virtual bidding strategy for electricity markets using stochastic control.

problem Optimizing electricity prices in day-ahead and real-time markets.
method Modeling price differences as Brownian motion with meteorological variables, transforming into portfolio management problem.
result Developed a strategy to manage electricity prices efficiently.

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…

2010-07-24abs ↗pdf ↗

BiCB combines traffic prediction and bidding optimization for live advertising.

problem Real-time bidding in live advertising with unknown future traffic.
method Binary Constrained Bidding (BiCB) that merges mathematical analysis and statistical traffic estimation.
result BiCB achieves good approximation to optimal bidding results with low complexity.

The ad-trading desks of media-buying agencies are increasingly relying on complex algorithms for purchasing advertising inventory. In particular, Real-Time Bidding (RTB) algorithms respond to many auctions -- usually Vickrey auctions -- throughout the day for buying ad-inventory with the aim of maximizing one or severa…

2015-11-26abs ↗pdf ↗

Algorithm learns to bid in auctions with shilling, masking real bids.

problem Learning to bid in auctions manipulated by shilling.
method Combines interval-elimination and optimistic branches, debiases losing-side reports.
result Achieves dynamic-pricing rate ildeO(T2/3) ilde{\mathcal{O}}(T^{2/3}) and first-price auctions rate ildeO(T) ilde{\mathcal{O}}(\sqrt{T}).

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…

2017-05-26abs ↗pdf ↗

Optimal bidding strategy for multi-platform ad auctions under budget constraints.

problem Optimizing ad placements for budget-constrained advertisers across multiple platforms.
method Developed an optimal bidding strategy for non-incentive-compatible auctions with budget constraints.
result Maximized total utility across auctions while satisfying budget constraints in expectation.

Approach to optimize bidding policies offline using reinforcement learning.

problem Optimizing spending in online advertising under budget constraints.
method Offline reinforcement learning for optimizing differentiable base policies.
result Statistically significant performance gains in production bidding environments.

A new relaxed framework for pricing illiquid derivatives using bid-ask spreads.

problem Pricing illiquid derivatives with realistic bounds and hedging prices.
method Introducing Bid--Ask Martingale Optimal Transport (BAMOT) that relaxes the exact calibration of model marginals to mid-prices of vanilla options.
result BAMOT yields realistic price bounds and superhedging prices for illiquid derivatives.

Proposes a framework for modeling RTB auctions using point processes.

problem Modeling and optimizing repeated auctions in the RTB ecosystem.
method Develops a stochastic framework using point processes to model and optimize RTB auctions.
result The proposed framework can be approximated to a Poisson point process, enabling the use of established properties.

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…

2014-07-12abs ↗pdf ↗

This paper tackles optimal bidding strategies in adversarial first-price auctions.

problem How to bid optimally and efficiently in adversarial first-price auctions.
method Developed a minimax optimal online bidding algorithm leveraging expert-chaining structure and exploiting product structure.
result Achieved an O~(T)\widetilde{O}(\sqrt{T}) regret, superior to existing algorithms.

Real-Time Bidding is nowadays one of the most promising systems in the online advertising ecosystem. In the presented study, the performance of RTB campaigns is improved by optimising the parameters of the users' profiles and the publishers' websites. Most studies about optimising RTB campaigns are focused on the biddi…

2019-10-29abs ↗pdf ↗

This paper optimizes ad bids and daily budgets for multiple campaigns in pay-per-click advertising.

problem Optimizing ad bids and daily budgets for multiple campaigns in pay-per-click advertising.
method Formulated as a combinatorial semi-bandit problem, solved using Gaussian Processes and four algorithms.
result Regret upper bounded as O(sqrt{T}), where T is the time horizon.

Model predicts bid and ask price dynamics with spread-dependent intensities.

problem Predicting bid and ask price dynamics in high-frequency stock markets.
method Extended Hawkes process with zero intensities, spread-dependent intensities, and negative excitement.
result Spread-narrowing tendency, excitations caused by previous events, impact of flash crashes, and different market participant features.

Paper uses reinforcement learning to optimize bid-ask spreads in OTC markets.

problem Optimizing bid-ask spreads in over-the-counter markets with dynamic order sizes.
method Reinforcement learning to solve high-dimensional stochastic control problem.
result Optimal bid-ask spreads follow a Gaussian distribution under certain conditions.

We develop a theory of bid and ask price dynamics where the two prices form due to interaction of buy and sell orders. In this model the two prices are represented by eigenvalues of a 2x2 price operator corresponding to "bid" and "ask" eigenstates. Matrix elements of price operator fluctuate in time which results in ph…

2013-12-17abs ↗pdf ↗

The paper shows how to calculate risk-neutral default probabilities from bid and ask CDS quotes.

problem Calculating risk-neutral default probabilities from market quotes.
method Using conic finance framework and Poisson process to formulate and solve the calibration problem.
result A unique solution for risk-neutral default probabilities and implied liquidity.

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…

2006-07-10abs ↗pdf ↗

Study optimal bidding strategies for digital ads targeting purchases and health campaigns.

problem Optimizing advertising strategies in digital channels.
method Continuous-time models encoding user behavior and auction mechanisms, semi-explicit formulas for optimal bidding.
result Semi-explicit formulas for optimal value and bidding policy for different types of advertising.

Study optimal semi-static hedging for illiquid markets using dynamic cash and static quoted derivatives.

problem Optimal pricing of exotic derivatives in illiquid markets with bid-ask spreads.
method Use Galerkin method and integration quadratures to approximate hedging problem as convex optimization, solved by interior point method.
result Semi-static hedging improves pricing and reduces transaction costs compared to static or dynamic trading alone.

The statistical properties of the bid-ask spread of a frequently traded Chinese stock listed on the Shenzhen Stock Exchange are investigated using the limit-order book data. Three different definitions of spread are considered based on the time right before transactions, the time whenever the highest buying price or th…

2006-12-31abs ↗pdf ↗

This paper deals with numerical solutions to an impulse control problem arising from optimal portfolio liquidation with bid-ask spread and market price impact penalizing speedy execution trades. The corresponding dynamic programming (DP) equation is a quasi-variational inequality (QVI) with solvency constraint satisfie…

2010-06-04abs ↗pdf ↗

The paper introduces SuccessProbaMax to optimize policy success probability in online advertising.

problem Optimizing policy success probability in online advertising systems.
method SuccessProbaMax algorithm that optimizes for the probability of success rather than expected value.
result SuccessProbaMax outperforms conventional algorithms in terms of success rate.