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

Trend · papers per month

6121824 · Jun 202019922001200920182026
48 results for irrational players

Modeling stock price adjustments due to irrational agent behavior.

problem Understanding and measuring irrational behavior in financial markets.
method Irrational Fractional Brownian Motion model to analyze agent reactions to news.
result Observation of kink-like effect suggesting soliton-like behavior in stock price adjustments.

Study irrational pencils on complex manifolds, finding non-finitely generated homology.

problem Understanding the homology of the kernel induced by irrational pencils on complex manifolds.
method Analyzing critical points and homology of fundamental groups of complex manifolds.
result Homology of the kernel of the morphism induced by the pencil on fundamental groups is not finitely generated.

Study symplectic and Hamiltonian actions on irrational ruled surfaces, proving existence and non-existence of extensions.

problem Tackles the extension of symplectic and Hamiltonian cyclic actions to Hamiltonian circle actions on irrational ruled symplectic 4-manifolds.
method Constructs symplectic involutions and cyclic actions, classifies symplectic morphisms, and proves non-extendability of certain actions.
result Shows existence and non-existence of Hamiltonian circle actions for different cyclic actions on irrational ruled symplectic 4-manifolds.

We show that the Novikov-Shubin invariant of an element of the integral group ring of the lamplighter group Z_2 \wr Z can be irrational. This disproves a conjecture of Lott and Lueck. Furthermore we show that every positive real number is equal to the Novikov-Shubin invariant of some element of the real group ring of Z…

2010-09-01abs ↗pdf ↗

We give examples of finitely presented groups containing elements with irrational (in fact, transcendental) stable commutator length, thus answering in the negative a question of M. Gromov. Our examples come from 1-dimensional dynamics, and are related to the generalized Thompson groups studied by M. Stein, I. Liousse …

2007-09-29abs ↗pdf ↗

New coefficient detects irrational rotation behavior on infinite-type surfaces.

problem Detecting irrational rotation behavior on surfaces of infinite type.
method Introducing a new quasimorphism, the Dehn twist coefficient, and proving its properties.
result The Dehn twist coefficient can have image all of R for some infinite-type surfaces.

In this paper, we prove that on every Finsler nn-sphere (Sn,F)(S^n, F) for n6n\ge 6 with reversibility λλ and flag curvature KK satisfying (λλ+1)2<K1(\fracλ{λ+1})^2<K\le 1, either there exist infinitely many prime closed geodesics or there exist [n2]2[\frac{n}{2}]-2 closed geodesics possessing irrational average indices. If in add…

2008-11-29abs ↗pdf ↗

We study the geometry of the Margulis region associated with an irrational screw translation gg acting on the 4-dimensional real hyperbolic space. This is an invariant domain with the parabolic fixed point of gg on its boundary which plays the role of an invariant horoball for a translation in dimensions 3\leq 3. Th…

2013-04-19abs ↗pdf ↗

Modeling preference rankings with salient features to explain irrational choices.

problem Estimating rankings from noisy pairwise comparisons with irrational choices.
method Salient feature preference model with maximum likelihood estimation.
result Strong performance of maximum likelihood estimation on synthetic and real data.

This paper uses hyperbolic geometry to prove Markov's theorem on irrational numbers and quadratic forms.

problem Classifying worst irrational numbers and indefinite binary quadratic forms with farthest values from zero.
method New proof using hyperbolic geometry, translating between hyperbolic geometry and algebra/number theory.
result Demonstrates how simple closed geodesics and ideal triangulations of the modular torus relate to the problems of straight lines and quadratic forms.

Given a discrete subgroup of the isometries of n-dimensional hyperbolic space there is always a region kept precisely invariant under the stabilizer of a parabolic fixed point, called the Margulis region. While in dimensions 2 and 3 this region is a horoball, it has in general a more complicated shape due to the existe…

2012-09-25abs ↗pdf ↗

Proposes a generic prediction architecture for autonomous vehicles considering both rational and irrational driving behaviors.

problem Accurately predicting future behaviors of surrounding vehicles for safe autonomous vehicle planning.
method Combines learning-based and planning-based models to address rationalities in human behavior.
result Stable prediction performance under various unseen driving scenarios.

In this paper, we present a multi-period trading model by assuming that traders face not only asymmetric information but also heterogenous prior beliefs, under the requirement that the insider publicly disclose his stock trades after the fact. We show that there is an equilibrium in which the irrational insider camoufl…

2011-05-12abs ↗pdf ↗

Researchers calculate Morse index and nullity for two specific minimal hypersurfaces.

problem Calculating Morse index and nullity for homogeneous minimal hypersurfaces with g=4g = 4 or 66.
method Analyzing two specific homogeneous minimal hypersurfaces in SnS^n with g=4g = 4.
result Obtained irrational eigenvalues in Laplace spectra for the two hypersurfaces.

A policy for near-optimal multi-player bandits with non-zero collision rewards.

problem Decentralized multi-player bandits with heterogeneous rewards and collisions.
method A policy achieving near-optimal regret in a non-communicative setting.
result Near order-optimal expected regret of O(log1+δT)O(\log^{1 + δ} T) for 0<δ<10 < δ< 1.

A multi-player bandit system resists adversarial attacks with near-optimal regret.

problem Adversaries attempt to manipulate rewards in a multi-player multi-armed bandit game.
method Players communicate a single bit to resist attacks, achieving near-optimal regret.
result Achieves near-optimal regret of O(log1+δT+W)O(\log^{1+δ}T + W), where WW is the total time of adversarial attacks.

New algorithm reduces regret in multi-player bandits with collision information.

problem Optimizing decisions in multi-player bandits with collision penalties.
method Developed an algorithm with optimal T\sqrt{T} regret under collision announcements, and sublinear regret without collision info.
result First T\sqrt{T}-type regret guarantee for non-stochastic multi-player multi-armed bandits with collision information.

New algorithm for multi-player bandits with selfish players, achieving logarithmic regret.

problem Challenges of robustness to selfish players in multi-player bandits.
method First algorithm robust to selfish players achieving logarithmic regret, with or without collision observation.
result Achieved logarithmic regret for robust algorithms to selfish players in multi-player bandits.

Symmetric game analysis shows Nash equilibria in three strategic states.

problem Analyzing Nash equilibria in a symmetric multi-player zero-sum game with two strategic variables.
method Using the minimax theorem by Sion to show equivalence of Nash equilibria.
result Nash equilibria are equivalent in three strategic states.

Paper uses Apprenticeship Learning to model player behavior in interactive narratives.

problem Understanding and simulating player behavior in interactive narratives.
method Receding Horizon IRL (RHIRL) to learn reward functions and policies.
result RHIRL can learn action sequences and generate behavior similar to specific players.

New algorithm tackles multi-player bandit problems with limited access to arms.

problem Limited access to dynamic local subsets of arms in multi-player multi-armed bandit problems.
method Adopted Upper Confidence Bound (UCB) for exploration-exploitation and distributed optimization for collisions.
result Proposes a decentralized algorithm with near-optimal regret guarantee.

Study predicts soccer player market values using machine learning and SHAP for interpretability.

problem Predicting accurate market values for professional soccer players.
method Ensemble machine learning models, SHAP for interpretability, Boruta for feature selection.
result GBDT model achieved high predictive accuracy (R-squared 0.901, RMSE 3,221,632.175).

Algorithm optimizes multi-player learning with noisy rewards without direct communication.

problem Cooperative multi-player learning with noisy rewards and no communication.
method Upper and lower confidence bounds algorithm for optimal action selection.
result Achieves logarithmic O(logTΔa)O(\frac{\log T}{Δ_{\bm{a}}}) and O(TlogT)O(\sqrt{T\log T}) regret.

New strategy achieves optimal regret without communication or collisions in multi-player bandit.

problem Cooperative multi-player stochastic multi-armed bandit with shared randomness.
method Combination of combinatorial approach to generalize geometric intuition.
result Achieves near-optimal regret ildeO(T) ilde{O}(\sqrt{T}) for any number of players and arms without collisions.

New algorithm for multi-player bandits in decentralized, asynchronous systems.

problem Challenges in decentralized, asynchronous multi-player bandits, including coordination and player detection.
method Adaptive exploration-exploitation algorithm that reduces collisions and detects player presence.
result Achieves regret of O(TlogT+logT/Δ2)\mathcal{O}(\sqrt{T \log T} + {\log T}/{Δ^2}).