A new DSP bidding strategy maximizes revenue under budget constraints.
problem Optimizing ad selection and bid price in RTB auctions.
method Formalized as a constrained optimization problem, proposed augmented MMKP solution.
result Our strategy outperforms state-of-the-art methods in real applications.
Deep network optimizes ad bidding for first-price auctions.
problem Optimizing bid prices for first-price auctions in online advertising.
method Introduced a deep distribution network for optimal bidding.
result Algorithm outperforms previous methods in terms of surplus and eCPX metrics.
The paper proposes a new method to forecast winning prices in real-time bidding.
problem Accurately forecasting winning prices in real-time bidding with limited data.
method The paper introduces a heteroscedastic fully parametric censored regression approach and a mixture density censored network.
result The proposed method significantly improves winning price forecasting compared to existing methods.
Efficient DSP features reduce speech recognition memory usage.
problem Limited memory on DSPs for speech recognition.
method Developed efficient bottleneck features (BNFs) for DSPs.
result Reduced speech recognition memory usage by 10x with minimal accuracy loss.
Paper addresses CPA line forecasting in online advertising mid-flight.
problem Forecasting ad campaign performance mid-flight considering bidding mechanisms.
method Generates relationships between metrics and optimization signals, estimates sensitivity, and characterizes advertiser spends vs. eCPA.
result Demonstrates promising accuracy in forecasting against actual deliveries.
A new method for density estimation using mixture discrepancy and moments.
problem Generalizing histogram statistics to higher dimensions.
method Density estimation via mixture discrepancy and moments (DSP-mix and MSP).
result DSP-mix and MSP are computationally tractable and maintain accuracy with increased speed.
Paper proposes DSP to accelerate deep learning model training by addressing locking and straggler problems.
problem Training deep neural networks is slow and inefficient due to locking and straggler issues.
method Layer-wise Staleness and DSP algorithm to handle locking and straggler problems.
result DSP achieves significant training speedup with stronger robustness than compared methods.
This paper presents a unified framework to tackle estimation problems in Digital Signal Processing (DSP) using Support Vector Machines (SVMs). The use of SVMs in estimation problems has been traditionally limited to its mere use as a black-box model. Noting such limitations in the literature, we take advantage of sever…
Study proposes an ad creative selection algorithm considering user fatigue.
problem Ad creative effectiveness varies with user exposure.
method Proposes an algorithm that considers user fatigue in ad selection.
result The proposed algorithm outperforms baseline algorithms in real-world testing.
ECG-DelNet uses neural networks to accurately delineate ECGs, even with low-quality data.
problem Lack of model explainability and small databases limit deep learning applicability in ECG detection.
method Adapted U-Net architecture for 1D data, used PhysioNet's QT database, applied data augmentation and regularization techniques.
result Best configuration achieved high precision and recall for P, QRS, and T waves.
Paper presents a self-adaptive learning model for robust classification and regression.
problem Dealing with various datasets of different complexity.
method Combines DNDN and DSP, an end-to-end training approach with multiple randomly initialized softmax layers and adaptive soft pruning.
result The model demonstrates no performance loss compared with unpruned models and higher robustness over different data and feature distributions.
Improved signal processing for long-distance optical signals.
problem Compensating walk-off effect in long-distance optical signals.
method Sub-banded DSP architecture with deep learning for walk-off compensation.
result 2.8 dB SNR improvement over linear equalization.
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…
New ML method detects incomplete bid-rigging cartels.
problem Detecting incomplete bid-rigging cartels in competitive bidding.
method Combines statistical screens with machine learning.
result Algorithm outperforms existing methods in incomplete cartels.
A paper on optimizing ad bidding with multi-agent reinforcement learning.
problem Optimizing ad revenue and ROI in real-time display advertising.
method Multi-agent reinforcement learning with clustering and coordinated bidding.
result Cluster-based bidding outperforms single-agent and bandit approaches.
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.
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 i l d e O ( T 2 / 3 ) ilde{\mathcal{O}}(T^{2/3}) i l d e O ( T 2/3 ) and first-price auctions rate i l d e O ( T ) ilde{\mathcal{O}}(\sqrt{T}) i l d e O ( T ) . 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.
Develops a new bidding system to maximize advertiser profit.
problem Inaccurate prediction of ad lift-effect due to biased log data.
method Unbiased Lift-based Bidding System that predicts lift-effect from biased log data.
result Demonstrates superior and practical high-performing lift-based bidding strategy.
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}) O ( T ) regret, superior to existing algorithms. Optimizes bidding strategy for Maker Protocol auctions.
problem Minimizing costs in Maker Protocol auctions.
method Developed and optimized a bidding function using historical data.
result Most auctions end at higher prices than optimal recommendations.
Optimizes bidding strategies for LinkedIn ads across multiple platforms.
problem Optimizing automated bidding agents for dynamic online marketplaces.
method Developed a general optimization framework for buyer's interest, agnostic to auction mechanisms.
result Automatically guarantees the optimality of budget allocation across ad units and platforms.
New bid shading algorithm reduces costs by 55%.
problem Minimizing costs in online advertising auctions.
method Win-rate prediction and surplus maximization using logistic regression.
result 7% more profit for advertisers compared to benchmarks.
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…
New attribution model boosts ad bidding efficiency.
problem Inefficiency of standard bidding policies in ad exchanges.
method Developed and applied an attribution model within the bidder.
result Average bid increased after incorporating attribution model.
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.
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 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…
Optimized OCPC strategy improves Taobao's ad traffic allocation efficiency.
problem Inefficient bid matching between advertisers and traffic quality.
method Proposed OCPC strategy to automatically adjust bids for finer matching.
result Substantially better results compared to fixed bid methods in production tests.
Deep learning detects bid-rigging cartels with high accuracy.
problem Detecting bid-rigging cartels using pairwise bidding interactions.
method Convolutional neural networks applied to graphs of normalized bid values.
result Convolutional neural networks achieve around 90% accuracy in classifying collusive and competitive bidding interactions.
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.
Quantum theory explains price dynamics in financial markets, capturing bid-ask spread and ergodicity.
problem Nature of price formation in financial markets and bid-ask spread dynamics.
method Developed a quantum coupled-wave theory using a 2x2 price operator with eigenvalues representing bid and ask prices.
result The theory adequately models bid-ask spread and directional price movement due to quantum-chaotic interaction.
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.
This paper improves bidding price prediction for ancillary services markets, boosting revenues.
problem Volatility in renewable energy sources affects grid stability and revenue optimization.
method Machine learning models (SVR, DT, k-NN) and offset adjustment for pay-as-bid markets.
result The proposed approach increases potential revenues by 27.43% to 37.31% compared to baseline models.
This work optimizes bid strategies for online auctions using measure-valued optimization.
problem Optimizing bid strategies in first-price auctions to maximize expected surplus.
method Formulates the problem as convex optimization over the joint distribution of shading parameters, adapts the distribution after each auction using a Wasserstein-proximal update.
result The proposed algorithm encourages bids on values with high expected surplus.
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
problem Interpreting bids from grid-scale batteries in wholesale electricity markets under price uncertainty
method Developing an asset-level model of a price-taking battery
result Empirical results deliver insights into withholding behavior, uncertainty effects, and risk management reshaping bid curves
Paper proposes a decentralized payment clearing system using blockchain and optimal bidding strategies.
problem Default contagion in a network of smart contracts cleared through blockchain.
method Constructs a decentralized clearing mechanism using blockchain and optimal bidding strategies.
result Proves existence and uniqueness of equilibrium clearing condition for terminal net worths.
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.
Study builds labeled shill bidding dataset for auction fraud detection.
problem Difficulty in detecting shill bidding in auctions.
method Hierarchical clustering CURE for systematic labeling of fraud data.
result CURE approach effectively labels shill bidding instances with multidimensional features.
Paper analyzes bidding strategies in smart grid PDAs, proposing a new method that outperforms existing strategies.
problem Optimizing bidding strategies in smart grid PDAs to balance energy demand effectively.
method Theoretical analysis of double auctions, derivation of best response, and modeling as an MDP.
result Proposed MDPLCPBS strategy outperforms existing strategies in the PowerTAC wholesale market PDA.
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.
problem Modeling bid and ask prices of a European asset.
method Formulates a stochastic control problem, uses Girsanov theorem, Esscher transform, and dynamic programming.
result Derives equations to determine bid and ask prices.
Improved learning algorithm for first-price auctions reduces regret significantly.
problem Challenges in learning optimal bidding strategies for first-price auctions.
method Introduced novel ideas to achieve lower regret in sequential learning.
result Achieved l o g 2 ( T ) log^2(T) l o g 2 ( T ) regret when opponents' bid distribution is known, and T 1 / 3 + ε T^{1/3+ ε} T 1/3 + ε regret in learning case. A new method calculates implied volatilities without using option prices.
problem Calculating implied volatilities without option prices.
method Conic finance approach to uniquely strip volatilities from bid and ask quotes.
result Allows joint calculation of implied liquidity from bid and ask quotes.
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 …
Study proposes a machine learning method for bid shading in first-price auctions.
problem Maintaining strategy equilibrium in first-price auctions.
method Machine learning approach to model optimal bid shading.
result Demonstrates superiority and robustness of new approach across various metrics.