We provide an exact analytical solution of the Nash equilibrium for - price auctions. We also introduce a new type of auction and demonstrate that it has fair solutions other than the second price auctions, therefore paving the way for replacing second price auctions.
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
48 results for “second-price auctions”
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.
Efficient algorithms for second-price auctions with action-dependent censoring.
problem Sequential bidding strategies for repeated auctions with incomplete information.
method Proposed novel UCB-like algorithms for second-price auctions in a stochastic setting.
result Significant improvement in worst-case regret, especially for low item values.
Study learns optimal bidding strategy in auctions with dynamic values and aggregated feedback.
problem Optimizing bidding in auctions with time-dependent values and limited feedback.
method Combines plug-in estimators with differential-equation characterization of optimal policy.
result Achieves near optimal regret bounds for learning optimal policy.
Objective Variables for Probabilistic Revenue Maximization in Second-Price Auctions with Reservestat.ML
Many online companies sell advertisement space in second-price auctions with reserve. In this paper, we develop a probabilistic method to learn a profitable strategy to set the reserve price. We use historical auction data with features to fit a predictor of the best reserve price. This problem is delicate - the struct…
We investigate contextual online learning with nonparametric (Lipschitz) comparison classes under different assumptions on losses and feedback information. For full information feedback and Lipschitz losses, we design the first explicit algorithm achieving the minimax regret rate (up to log factors). In a partial feedb…
Study optimal auction formats for maximizing MEV on Ethereum.
problem Maximizing extractable value from Ethereum auctions.
method Empirical analysis of 2.2 million transactions, modeling affiliation among bidders.
result English and second-price sealed-bid auctions dominate other formats, with significant revenue losses.
We study revenue optimization learning algorithms for repeated second-price auctions with reserve where a seller interacts with multiple strategic bidders each of which holds a fixed private valuation for a good and seeks to maximize his expected future cumulative discounted surplus. We propose a novel algorithm that h…
A new RL approach optimizes reserve prices in multi-phase auctions, reducing revenue regret.
problem Optimizing reserve prices in multi-phase second-price auctions with noisy and potentially untruthful bidders.
method Combines RL techniques with buffer periods, a novel algorithm, and LSVI-UCB extension.
result Achieves optimal revenue regret under known and unknown noise conditions.
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 regret, superior to existing algorithms.
Optimistic Mirror Descent framework improves bidding strategies in non-stationary first-price auctions.
problem Optimizing bidding strategies in non-stationary first-price auctions.
method Introducing Optimistic Mirror Descent (OMD) framework with novel optimism configuration.
result Minimax-optimal dynamic regret rates achieved for non-stationary first-price auctions.
Study shows priority access in ELA auctions is less valuable due to volatility risks.
problem Impact of volatility on time-based transaction ordering policies.
method Single-round model with risk-averse bidders, tested using ETH price data.
result Priority access is discounted due to volatility and risk aversion.
Efficient methods estimate bid and value distributions in auctions.
problem Estimating bid and value distributions in auctions with limited information.
method Non-parametric estimation algorithms for first- and second-price auctions.
result Uniform estimation bounds for bid and value distributions, independent of distributions being estimated.
In this paper, we study the non-stationary online second price auction problem. We assume that the seller is selling the same type of items in rounds by the second price auction, and she can set the reserve price in each round. In each round, the bidders draw their private values from a joint distribution unknown t…
We present an original theorem in auction theory: it specifies general conditions under which the sum of the payments of all bidders is necessarily not identically zero, and more generally not constant. Moreover, it explicitly supplies a construction for a finite minimal set of possible bids on which such a sum is not …
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…
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.
Optimizes web publisher revenues from RTB auctions.
problem Maximizing revenue from RTB auctions with limited information.
method Incremental time-weighted matrix factorization for user and placement profiles; Aalen's Additive model for censored bid predictions.
result Significant revenue increase for web publishers.
Over the last decade, digital media (web or app publishers) generalized the use of real time ad auctions to sell their ad spaces. Multiple auction platforms, also called Supply-Side Platforms (SSP), were created. Because of this multiplicity, publishers started to create competition between SSPs. In this setting, there…
Ad exchanges use CORP to set reserve prices against strategic buyers.
problem Setting optimal reserve prices in ad exchanges with strategic buyers.
method Proposes CORP policy to learn and set reserve prices robustly.
result Achieves sublinear regret in unknown noise distribution.
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…
We consider the problem of a single seller repeatedly selling a single item to a single buyer (specifically, the buyer has a value drawn fresh from known distribution in every round). Prior work assumes that the buyer is fully rational and will perfectly reason about how their bids today affect the seller's decisio…
In this paper, we study the stochastic version of the one-sided full information bandit problem, where we have arms , and playing arm would gain reward from an unknown distribution for arm while obtaining reward feedback for all arms . One-sided full information bandit ca…
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…
We consider a dynamic pricing problem for repeated contextual second-price auctions with multiple strategic buyers who aim to maximize their long-term time discounted utility. The seller has limited information on buyers' overall demand curves which depends on a non-parametric market-noise distribution, and buyers may …
Equity auctions show linear price impact up to a large volume, then non-linear.
problem Understanding price impact in equity auctions.
method High-quality data analysis of Paris stock exchange auctions.
result Price impact is linear up to a large volume, then becomes non-linear.
The paper tackles auction market design flaws by randomizing closing times and optimizing transaction fees.
problem Strategic traders exploit accumulated information to delay their orders, distorting auction efficiency.
method Randomizing auction closing times and designing optimal transaction fees policies.
result Policies encourage strategic traders to send orders earlier, improving auction market efficiency.
The study compares uniform-price and discriminatory auctions in terms of learning difficulty.
problem Comparing the learning difficulty of uniform-price and discriminatory multi-unit auctions.
method Characterization of learning difficulty through regret minimization in both full-information and bandit feedback settings.
result Regret scales similarly for both auction formats under full-information, but uniform-price auctions can achieve faster learning rates.
We first investigate the evolution of opening and closing auctions volumes of US equities along the years. We then report dynamical properties of pre-auction periods: the indicative match price is strongly mean-reverting because the imbalance is; the final auction price reacts to a single auction order placement or can…
AHEAD improves financial market efficiency through ad-hoc auctions.
problem Improving financial market efficiency and reducing transaction costs.
method Introducing a new matching design (AHEAD) for electronic markets where participants can trade at a fixed price and trigger auctions when unsatisfied.
result A Nash equilibrium is achieved in the market, and ad-hoc auctions are more relevant and efficient than periodic auctions and continuous limit order books.
Study on heavy tails in closing auction returns, explaining imbalance through limit order submission.
problem Understanding heavy tails in closing auction return distributions.
method Used the stochastic call auction model of Derksen et al. (2020a) to derive and verify a relation between tail exponents.
result Large closing price fluctuations are not caused by large market orders, but by imbalance in limit orders.
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.
Extends PoS proof-of-stake transaction fee mechanism with miner utility model.
problem Designing a transaction fee mechanism for PoS protocol that incorporates miner utility.
method Introduced a new mechanism (BSP(θ)) incorporating a parameter θ to ensure user and miner incentives.
result The new mechanism (BSP(θ)) satisfies user and miner incentives and contract proofness.
In the last three decades, we have seen a significant increase in trading goods and services through online auctions. However, this business created an attractive environment for malicious moneymakers who can commit different types of fraud activities, such as Shill Bidding (SB). The latter is predominant across many a…
Study on efficiency of Dutch auctions on blockchains considering various parameters.
problem Efficiency and fairness in Dutch auctions on blockchains.
method Modeling Dutch auctions with Poisson process and geometric Brownian motion, computing expected losses and time-to-fill.
result Tradeoff between speed and quality in Dutch auctions, useful for setting parameters.
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.
Paper addresses selection bias in online advertising auctions.
problem Selection bias affects auction truthfulness and advertiser profits.
method Theoretical analysis combined with multi-task learning.
result Selection bias can be significantly reduced using multi-task learning.
MiFID II impacts European stock liquidity and price formation.
problem Impact of MiFID II on European stock liquidity and price formation.
method Analyzed effects of MiFID II on European stock markets, focusing on intraday and closing auction liquidity and tick size changes.
result Closing auction volumes increased and price formation became more efficient after MiFID II.
New algorithm optimizes auction prices in real-time.
problem Maximizing revenue in online auctions with high frequency data.
method First real-time algorithm for online learning of monopoly prices.
result Achieves constant time and memory complexity for updates.
Study adapts liquidity model to equity auctions, revealing accelerated event rates and reduced price impact.
problem Understanding and predicting price dynamics in equity auctions.
method Adapted latent/revealed order book framework to equity auctions, measuring order submissions, cancellations, and diffusion rates.
result Equity auctions exhibit accelerated event rates leading to reduced price impact and decreased volatility.
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.
Paper proposes auction method for smart derivatives to avoid disputes.
problem Disputes over derivative liquidation processes in smart contracts.
method Defines an auction type resolution for smart derivatives.
result Proposes a beneficial method for smart derivatives participants.
The paper examines how builders in Ethereum auctions can defect and replicate winning MEV opportunities, affecting searchers' bidding strategies.
problem Commitment problem in Ethereum auctions where builders can defect and replicate winning MEV opportunities.
method Modeling and analysis of searchers' bidding strategies and the resulting equilibrium, using libMEV dataset.
result The equilibrium is piecewise, with the cost of imperfect commitment depending on replicability and competition. There is sharp heterogeneity across MEV types.
Lowest Unique Bid Auctionsmath.PR
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…
Optimizes reserve prices for first-price auctions to maximize revenue.
problem Optimizing reserve prices for first-price auctions in display advertising.
method Gradient-based algorithm to adaptively update and optimize reserve prices based on bidder responsiveness to experimental shocks.
result Revenue optimization in first-price auctions can be decomposed into demand and bidding components, and techniques are introduced to reduce variance of each.
We develop extensions to auction theory results that are useful in real life scenarios. 1. Since valuations are generally positive we first develop approximations using the log-normal distribution. This would be useful for many finance related auction settings since asset prices are usually non-negative. 2. We formulat…
Algorithm learns to bid optimally in repeated first-price auctions with censored feedback.
problem Learning to bid optimally in repeated first-price auctions with incomplete feedback.
method Developed an algorithm exploiting the specific feedback structure and payoff function of first-price auctions.
result Achieved a near-optimal regret bound for first-price auctions.
Permutation-equivariant neural networks improve auction mechanisms by reducing regret and sample complexity.
problem Designing optimal auction mechanisms that balance revenue and bidders' regret.
method Introduced permutation-equivariant neural networks to auction mechanisms.
result Permutation-equivariant neural networks decrease expected ex-post regret and improve model generalizability.