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,742 papers · 148 categories

Trend · papers per month

4793140186 · May 202619922001200920172026
48 results for bidding mechanisms

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.

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.

Improved εε-greedy handles strategic bidding in PPC auctions.

problem Strategic bidding in PPC auctions with personalization and corruptions.
method Extended εε-greedy to handle strategic arms in contextual multi-arm bandit.
result εε-greedy is robust to adversarial corruptions and degrades linearly with corruption.

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 ↗

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.

This work's purpose is to understand the dynamics of limit order books in order-driven markets. We try to illustrate a dynamical trading mechanism attached to the microstructure of limit order markets. We capture the iterative nature of trading processes, which is critical in the dynamics of bid-ask pairs and the switc…

2013-03-13abs ↗pdf ↗

Modeling European spot power markets with game theory for Nash equilibria.

problem Optimizing electricity markets with risk-averse players and constraints.
method Game-theoretic framework with Jacobi and Gauss-Seidel schemes for approximate Nash equilibria.
result Innovative risk aversion model reduces price dimensionality and ensures boundedness.

We derive valuations of a portfolio of financial instruments from a securities lending perspective, under different assumptions, and show a weighting scheme that converges to the true valuation. We illustrate conditions under which our alternative weighting scheme converges faster to the true valuation when compared to…

2016-03-03abs ↗pdf ↗

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.

The author seeks to develop a model to alter the bid-offer spread, currently quoted by market makers, that varies with the market and trading conditions. The dynamic nature of financial markets and trading, as with the rest of social sciences, where changes can be observed and decisions can be made by participants to i…

2016-01-01abs ↗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.

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 ↗

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 ildeO(T2/3) ilde{\mathcal{O}}(T^{2/3}) and first-price auctions rate ildeO(T) ilde{\mathcal{O}}(\sqrt{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.

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…

2001-02-12abs ↗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.

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.

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.

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 ↗

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.

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 …

2017-02-27abs ↗pdf ↗

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.

Privacy subsidy found in market trading with noisy direction signals.

problem Analyzing welfare and bid-ask spread in a market with privacy mechanisms.
method Closed-form derivation of bid-ask spread and welfare under flip-noise direction observation.
result Privacy subsidy of μηΔμηΔ from liquidity pool to traders, robust across models.

A liquidity measure based on consideration and price range is proposed. Initially defined for daily data, Liquidity Index (LIX) can also be estimated via intraday data by using a time scaling mechanism. The link between LIX and the liquidity measure based on weighted average bid-ask spread is established. Using this li…

2014-12-16abs ↗pdf ↗