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.

169,051 papers · 148 categories

Trend · papers per month

295988117 · Jun 202019922001200920182026
48 results for imperfect competition

New algorithm uses imperfect advice to improve online bipartite matching performance.

problem Online bipartite matching with imperfect advice.
method Designing an algorithm that uses external advice to improve performance between advice-free methods and optimal ratio.
result Algorithm achieves competitive ratio interpolating between advice-free methods and optimal ratio of 1.

High-frequency traders manage inventories to exploit price information, leading to mean-reverting inventories and excess trading.

problem Managing inventories for high-frequency traders in imperfect competition.
method Analyzes Nash equilibria for inventory-averse HFTs using nonlinear equations and asymptotic analysis.
result Optimal inventories become mean-reverting and vanish in the continuous-time limit, while HFTs' profits converge to risk-neutral counterparts.

Study cooperative bandit learning with imperfect communication, achieving near-optimal performance.

problem Real-world distributed decision-making with imperfect communication.
method Proposed decentralized algorithms for three communication scenarios: stochastic networks, random delays, and adversarially corrupted rewards.
result Achieved competitive performance and near-optimal guarantees on group regret.

Heuristic pricing strategy compensates for imperfect market anticipation in dynamic pricing competition.

problem Challenges in optimizing pricing strategies due to competition and limited demand information.
method Stochastic dynamic pricing models under oligopoly competition with frequent price adjustments.
result Price adjustment frequencies have a larger impact on expected profits than price anticipations.

DREAM learns optimal strategies in imperfect games without needing a simulator.

problem Learning optimal strategies in imperfect-information games with multiple agents.
method DREAM is a deep reinforcement learning algorithm that converges to Nash Equilibria and coarse correlated equilibria.
result DREAM achieves state-of-the-art performance in benchmark games and is competitive with simulator-based algorithms.

JPS improves joint policies for multi-agent collaboration in imperfect information games.

problem Learning good joint policies for multi-agent collaboration with imperfect information.
method Decomposes global changes to localized policy changes, iteratively improving joint policies without re-evaluating the entire game.
result JPS improves solutions provided by unilateral approaches and outperforms algorithms designed for collaborative policy learning.

Model shows disclosure reduces trading costs in oligopolistic markets.

problem Reducing trading costs in oligopolistic markets with imperfect competition.
method Developed a multi-period Kyle-type model with mandatory disclosure and imperfect competition, proving existence and uniqueness of a linear equilibrium.
result Disclosure lowers trading costs by reducing price impact, and its marginal benefit is larger when competition is weak.

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.

I study the limit of a large random economy, where a set of consumers invests in financial instruments engineered by banks, in order to optimize their future consumption. This exercise shows that, even in the ideal case of perfect competition, where full information is available to all market participants, the equilibr…

2009-06-08abs ↗pdf ↗

When society maintains a competitive system to promote an abstract goal, competition by necessity relies on imperfect proxy measures. For instance profit is used to measure value to consumers, patient volumes to measure hospital performance, or the Journal Impact Factor to measure scientific value. Here we note that \t…

2018-03-01abs ↗pdf ↗

The paper explores how regularization can lead to convergence in imperfect information games.

problem Finding equilibrium in imperfect information games with imperfect information.
method Investigates Follow the Regularized Leader dynamics and how adding a regularization term can lead to strong convergence guarantees.
result The approach leads to algorithms that converge exactly to the Nash equilibrium in imperfect information games.

The paper tackles learning from imperfect human feedback, especially in dueling bandit problems.

problem Learning from human feedback that can be irrational or imperfect.
method Developed a Robustified Stochastic Mirror Descent for Imperfect Dueling (RoSMID) algorithm.
result Achieved nearly optimal regret for dueling bandit problems under imperfect human feedback.

Model learns tensor representations from imperfect multimodal data.

problem Learning from imperfect multimodal data with noise or missing entries.
method Tensor rank minimization to regularize rank of tensor representations.
result Model effectively learns tensor representations from imperfect data.

Investigates a Kyle model with imperfect information and risk aversion.

problem Tackles a Kyle model with imperfect information and risk-averse informed traders.
method Solves an optimal transport problem and a filtering problem under specific measures.
result Constructs an equilibrium for the Gaussian Kyle model with imperfect information and risk aversion.

The paper proposes multicalibration to improve matching in graphs with imperfect predictors.

problem Finding the best matching in graphs with imperfect predictors.
method Introduces multicalibration as a fairness notion to ensure unbiasedness on protected sets of contexts.
result Constructing a multicalibrated predictor that outperforms standard optimal rules in matching algorithms.

In this paper, we present a multi-period trading model in the style of Kyle (1985)'s inside trading model, by assuming that there are at least two insiders in the market with long-lived private information, under the requirement that each insider publicly discloses his stock trades after the fact. Based on this model, …

2011-03-04abs ↗pdf ↗

Investors' strategic trading affects asset prices, modeled as a game.

problem Investors' trading rates influence asset prices in dynamic markets.
method Model as a non-zero sum singular stochastic differential game, establishing equivalence between best-response and auxiliary control problems.
result Unique Nash equilibrium is deterministic with a closed-form solution.

We study the effect of imperfect training data labels on the performance of classification methods. In a general setting, where the probability that an observation in the training dataset is mislabelled may depend on both the feature vector and the true label, we bound the excess risk of an arbitrary classifier trained…

2018-05-29abs ↗pdf ↗

Policy gradient method proves convergence in imperfect-information games.

problem Policy gradient methods in imperfect-information games (EFGs).
method Policy gradient approach with best-iterate convergence.
result Policy gradient leads to provable best-iterate convergence in self-play EFGs.

Triangle lasso improves clustering and optimization in noisy graphs.

problem Noise and missing data in graph datasets lead to sub-optimal clustering results.
method Triangle lasso uses neighbors' similarity to find similar instances, avoiding direct feature comparison.
result Triangle lasso yields better results than state-of-the-art methods in practical scenarios.

Deep neural network learns to play Big 2, a 4-player imperfect information game, outperforming amateurs.

problem Training a neural network to play a complex, imperfect information game with multiple players.
method Self-play reinforcement learning using Proximal Policy Optimization.
result Deep neural network trained via self-play reaches performance level surpassing amateur players.

Modeling the purposeful behavior of imperfect agents from a small number of observations is a challenging task. When restricted to the single-agent decision-theoretic setting, inverse optimal control techniques assume that observed behavior is an approximately optimal solution to an unknown decision problem. These tech…

2013-08-15abs ↗pdf ↗

Algorithm learns NE in imperfect information games with imperfect feedback.

problem Learning Nash equilibrium in imperfect information games with bandit feedback.
method IXOMD algorithm for model-free learning with 1/T1/\sqrt{T} convergence rate.
result IXOMD achieves 1/T1/\sqrt{T} convergence rate to NE.

Model financial markets using open quantum systems to understand market imperfections.

problem Understanding market imperfections through imperfect trading mechanisms.
method Using open quantum systems to represent financial markets, characterizing orbits, and analyzing reduced density matrices.
result Non-classical modes of time evolution can incorporate factors like illiquid trades and imperfect trading mechanisms.

Bayesian machine learning algorithm for causal effects with imperfect compliance.

problem Heterogeneous causal effects in imperfect compliance scenarios.
method Bayesian Causal Forest with Instrumental Variable (BCF-IV) methodology.
result BCF-IV outperforms other techniques in discovering and estimating heterogeneous causal effects.

The study examines how verifier imperfections impact test-time scaling techniques.

problem Understanding how verifier imperfections affect test-time scaling methods.
method Proves the instance-level accuracy of Best-of-N and Rejection Sampling methods using the geometry of the verifier's ROC curve.
result RS outperforms BoN for fixed compute, but both converge to the same accuracy in the infinite-compute limit.

Paper improves RL from imperfect demonstrations with soft expert guidance.

problem Improper and insufficient expert demonstrations in RLfD.
method Formalizes imperfect expert setting, tackles optimality and convergence issues with soft constraints, and uses local linear search on dual form.
result Method achieves consistent improvement over other RLfD methods.

Researchers develop methods for causal inference with imperfect instrumental variables.

problem Quantifying cause and effect relationships with imperfect instrumental variables.
method Established a quantitative relationship between violations of instrumental inequalities and minimal measurement dependence, providing adapted inequalities valid in the presence of relaxed measurement dependence.
result Adapted inequalities for average causal effect in instrumental scenarios with binary outcomes, addressing violations of instrumental inequalities.

Paper solves learning imperfect-information games with fewer episodes.

problem Learning imperfect-information extensive-form games from bandit feedback.
method Balanced Online Mirror Descent and Balanced Counterfactual Regret Minimization algorithms.
result Achieves near-optimal sample complexity for finding approximate Nash equilibria.

We study pricing and superhedging strategies for game options in an imperfect market with default. We extend the results obtained by Kifer in \cite{Kifer} in the case of a perfect market model to the case of an imperfect market with default, when the imperfections are taken into account via the nonlinearity of the weal…

2015-11-29abs ↗pdf ↗

New algorithms reduce regret in online learning with imperfect hints.

problem Designing algorithms to minimize regret in online learning with imperfect hints.
method Developed algorithms that are resilient to bad hints and interpolate between correlated and no-hints cases.
result Achieved nearly matching lower bounds for online learning with imperfect directional hints.

Bayesian framework mixes imperfect models for improved predictions.

problem Improving predictions of complex computational models in unknown domains.
method Local Bayesian Dirichlet mixing of imperfect models using the Dirichlet distribution.
result Global and local mixtures of models achieve excellent performance in prediction accuracy and uncertainty quantification.

Selective planning with imperfect models reduces harmful effects of model inadequacy.

problem Harmful effects of using an imperfect model in reinforcement learning.
method Selective planning with heteroscedastic regression to estimate predictive uncertainty from model inadequacy.
result Effective selective planning requires considering both parameter uncertainty and model inadequacy.

New method uses imperfect LLM annotations for valid statistical inference in social science.

problem Inaccurate large language model annotations in social science research.
method Design-based supervised learning (DSL) combining imperfect LLM surrogates with gold-standard labels.
result DSL provides valid statistical inference with comparable predictive accuracy to existing methods.

This paper explores how imperfect reward models can improve online RLHF.

problem Sample efficiency in online RLHF from imperfect reward models.
method Identifies policy coverability and proposes TPO algorithm for transfer learning.
result TPO algorithm improves sample efficiency compared to standard online learning.