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

35810 · Jun 202019922001200920172026
48 results for Dutch auctions

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.

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.

Improved negation detection in Dutch clinical texts using machine learning.

problem Extracting negation from clinical text for better model development.
method Comparison of rule-based and machine learning methods (biLSTM, RoBERTa).
result BiLSTM and RoBERTa models outperform rule-based method in F1 score, precision, and recall.

This thesis evaluates text-based vs audio-based classification of mental health interviews.

problem Classifying psychiatric illness using text-based methods.
method Design and evaluate a text classification network on mental health interviews, using belabBERT.
result Text-based classification is a strong alternative to audio-based methods.

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 ↗

West Frisian lemmatizer, POS tagger, and parser created.

problem Creating accurate lemmatization, POS tagging, and dependency parsing for West Frisian.
method Using a corpus of 44,714 words annotated according to Universal Dependency version 2. Applying Dutch POS tags and morphological/syntactic annotations to create Frisian translations.
result Significant improvement in lemma accuracy compared to default parameters.

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.

Improved power arbitrage through domain-adapted reinforcement learning.

problem Optimizing profit in the Dutch power market through arbitrage opportunities.
method Dual-agent reinforcement learning with imitation of power traders' behaviors.
result Significant improvement in cumulative profit and loss (P&L) with a three-fold increase.

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.

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.

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.

Dynamic-weight AMMs outperform traditional CEX rebalancing in tokenized funds, especially on L2s.

problem Improving asset allocation efficiency in decentralized finance (DeFi) protocols.
method Block-level arbitrage analysis and long-term performance benchmarks on two live pools.
result Dynamic-weight AMMs can achieve performance comparable to or better than traditional CEX rebalancing, especially on Layer 2 (L2) networks.

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.

New neural network architecture for auction design exploiting permutation symmetry.

problem Designing incentive-compatible auctions that maximize expected revenue.
method Constructed a permutation-equivariant neural network architecture.
result Permutation-equivariant architectures can perfectly recover optimal mechanisms.

This study evaluates price improvements in order flow auctions on Ethereum.

problem Improving trading outcomes in blockchain-based trading platforms.
method Utilized open-source tools to attribute price improvements to specific system inputs.
result Auction-enhanced interfaces can provide statistically significant improvements in trading outcomes, averaging 4-5 basis points.

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 ↗

Study optimizes rebate design in auction markets to enhance efficiency.

problem Designing optimal rebate policies in auction markets to improve efficiency.
method Formulated as a principal-agent problem, solved using Hamilton-Jacobi-Bellman equations and Deep BSDE method.
result Optimal transaction fees and rebates narrow the price spread, improving market efficiency.