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

Trend · papers per month

11223344 · Jun 202019922001200920172026
48 results for double auctions

Efficient verified double auctions improve matching speed and detect errors.

problem Improving the efficiency and reliability of double auctions in financial markets.
method Formally verified implementation using Coq proof assistant, reducing time complexity and improving error detection.
result Improved efficiency with O(nlogn)O(n \log n) time complexity, reducing runtime from days to minutes.

We study a phenomenological model for the continuous double auction, equivalent to two independent M/M/1M/M/1 queues. The continuous double auction defines a continuous-time random walk for trade prices. The conditions for ergodicity of the auction are derived and, as a consequence, three possible regimes in the behavior …

2013-05-13abs ↗pdf ↗

In this paper, we introduce a novel, non-recursive, maximal matching algorithm for double auctions, which aims to maximize the amount of commodities to be traded. It differs from the usual equilibrium matching, which clears a market at the equilibrium price. We compare the two algorithms through experimental analyses, …

2013-02-11abs ↗pdf ↗

The study classifies and imitates trading agents in financial markets.

problem Classifying and imitating trading agents in continuous double auctions.
method Developed an agent-based model for trading, applied opponent modeling for classification, and used behavioral cloning for imitation.
result Techniques for classification and imitation were experimentally compared and evaluated.

In this paper, the survival function of waiting times between orders and the corresponding trades in a double-auction market is studied both by means of experiments and of empirical data. It turns out that, already at the level of order durations, the survival function cannot be represented by a single exponential, thu…

2006-08-28abs ↗pdf ↗

Study on liquidity and market efficiency in auction games with imperfect information.

problem Generating liquidity in illiquid auction markets with imperfect information.
method Characterized Nash equilibria in a two-player game with imperfect information, linking market spreads to signal strength.
result Without incentives, the market is inefficient and does not lead to trades. Quadratic fees indexed on half spread can generate liquidity.

We introduce a formal framework for analyzing trades in financial markets. An exchange is where multiple buyers and sellers participate to trade. These days, all big exchanges use computer algorithms that implement double sided auctions to match buy and sell requests and these algorithms must abide by certain regulator…

2019-07-18abs ↗pdf ↗

Most modern financial markets use a continuous double auction mechanism to store and match orders and facilitate trading. In this paper we develop a microscopic dynamical statistical model for the continuous double auction under the assumption of IID random order flow, and analyze it using simulation, dimensional analy…

2002-10-22abs ↗pdf ↗

We provide an exact analytical solution of the Nash equilibrium for kk- 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.

2018-09-26abs ↗pdf ↗

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 give a stochastic microscopic modelling of stock markets driven by continuous double auction. If we take into account the mimetic behavior of traders, when they place limit order, our virtual markets shows the power-law tail of the distribution of returns with the exponent outside the Levy stable region, the short m…

2006-07-23abs ↗pdf ↗

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…

2018-02-06abs ↗pdf ↗

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 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.

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.

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.

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.

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 ↗

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…

2018-09-25abs ↗pdf ↗

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 O~(T)\widetilde{O}(\sqrt{T}) 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.