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

50100149199 · Jun 202019922001200920172026
48 results for hidden role games

The paper explains how simple methods can converge to optimal solutions in complex neural games.

problem Finding optimal solutions in neural games with non-convex objectives.
method Theoretical framework using hidden convexity and overparameterization, with path-length bounds and PŁ conditions.
result Simple gradient methods can converge to Nash equilibria in non-convex min-max games under certain conditions.

Gradient Descent Ascent converges to von-Neumann solution in hidden zero-sum games.

problem Understanding dynamics of zero-sum games with hidden structure.
method Gradient Descent Ascent applied to hidden zero-sum games with specific convex-concave structure.
result Gradient Descent Ascent converges to von-Neumann solution in strictly convex-concave hidden games.

DefogGAN predicts hidden RTS game information to aid strategic decision-making.

problem Predicting hidden information in real-time strategy games like StarCraft.
method Conditional Generative Adversarial Network (GAN) with pyramidal reconstruction loss.
result DefogGAN predicts enemy buildings and combat units as accurately as professional players.

Study explores reinforcement learning in a complex game environment, analyzing rule inference and policy learning.

problem Learning optimal policies in environments with hidden rules.
method Investigated using the Game Of Hidden Rules (GOHR) environment, employing Feature-Centric and Object-Centric state representations with a Transformer-based A2C algorithm.
result Transformer-based A2C models outperform traditional methods in GOHR, demonstrating the effectiveness of representation strategies.

CausalGame benchmarks LLM agents' causal thinking in games.

problem Evaluating causal thinking in AI Scientists with LLMs.
method Interactive games with 14 scenarios incorporating selection bias, measurement error, and hidden confounders.
result None of the 30 LLM agents demonstrated reliable causal thinking, with the best model achieving only 68.0% survival.

Using the Minority Game model we study a broad spectrum of problems of market mechanism. We study the role of different types of agents: producers, speculators as well as noise traders. The central issue here is the information flow : producers feed in the information whereas speculators make it away. How well each age…

1999-09-17abs ↗pdf ↗

Algorithm finds ε-equilibrium policies for multi-agent Markov games with hidden low-rank structure.

problem Designing efficient algorithms for multi-agent Markov games with unknown representation and hidden low-rank structure.
method Model-based and model-free approaches using representation learning to construct an effective representation from data.
result Achieves poly(H,d,A,1/ε)(H,d,A,1/\varepsilon) sample complexity for both model-based and model-free approaches.

Bardo Composer generates tabletop RPG music based on player speech.

problem Creating immersive background music for tabletop RPGs.
method Speech recognition, emotion classification, and music generation using a novel beam search algorithm.
result Generated music pieces can be accurately identified by human subjects as conveying the intended emotion.

We introduce CSE for MLSF games and devise online learning algorithms for achieving no-external Stackelberg-regret.

problem Learning equilibrium in leader-follower games with noisy bandit feedback.
method Proposed Correlated Stackelberg Equilibrium (CSE) and online learning algorithms balancing exploration and exploitation.
result Achieves no-external Stackelberg-regret, converging to approximate CSE.

The prospects of Kahneman and Tversky, Mega Million and Powerball lotteries, St. Petersburg paradox, premature profits and growing losses criticized by Livermore are reviewed under an angle of view comparing mathematical expectations with awards received. Original prospects have been formulated as a one time opportunit…

2015-12-27abs ↗pdf ↗

Market makers optimize bid/ask quotes under hidden Markov chain uncertainty.

problem Optimizing market quotes with hidden factors affecting order intensities.
method Solves stochastic control problem using filtering, control, and PDMPs theory.
result Value function is unique viscosity solution of dynamic programming equation.

A game theory study on optimal hiding and searching strategies in discrete locations.

problem Optimal hiding and searching strategies in a two-person zero-sum game between a hider and a searcher.
method Proved the existence of optimal strategies, developed an algorithm to compute them, and compared with a simple strategy.
result Optimal hiding strategy involves hiding in each location with nonzero probability, and optimal searching strategy can be constructed with up to n simple sequences.

Individuals, or organizations, cooperate with or compete against one another in a wide range of practical situations. Such strategic interactions are often modeled as games played on networks, where an individual's payoff depends not only on her action but also on that of her neighbors. The current literature has large…

2018-11-21abs ↗pdf ↗

Scaling up model and data size improves imitation learning in single-agent games.

problem Limited recovery of expert behavior in single-agent games using imitation learning.
method Investigate the effect of scaling model and data size on imitation learning performance.
result IL loss and mean return scale with compute budget, resulting in power laws.

Learning and inferring features that generate sensory input is a task continuously performed by cortex. In recent years, novel algorithms and learning rules have been proposed that allow neural network models to learn such features from natural images, written text, audio signals, etc. These networks usually involve de…

2015-06-01abs ↗pdf ↗

The dynamics of minority games with agents trading on different time scales is studied via dynamical mean-field theory. We analyze the case where the agents' decision-making process is deterministic and its stochastic generalization with finite heterogeneous learning rates. In each case, we characterize the macroscopic…

2003-06-19abs ↗pdf ↗

Social learning can make financial markets inefficient, but individual learning can fix this.

problem Inefficiencies in financial markets due to social learning.
method Study of the Minority Game model with social and individual learning mechanisms.
result Individual learning can rescue a population from the inefficiencies caused by social learning.

Activities in reinforcement learning (RL) revolve around learning the Markov decision process (MDP) model, in particular, the following parameters: state values, V; state-action values, Q; and policy, pi. These parameters are commonly implemented as an array. Scaling up the problem means scaling up the size of the arra…

2018-07-23abs ↗pdf ↗

Algorithm converges to Nash equilibria in competitive games.

problem Finding Nash equilibria in decentralized, competitive Markov games.
method Decentralized Optimistic Gradient Descent/Ascent with a critic.
result Converges to the set of Nash equilibria under self-play.

Unified game formulation for explaining machine learning models using Shapley values.

problem Uncertainty and misleading attributions in existing Shapley value methods.
method Unified game formulation that addresses uncertainty and provides confidence intervals.
result Unified framework for generating and interpreting contrastive explanations of ML models.

Study evaluates initialization strategies for infinite hidden Markov models.

problem Limited attention to initialization in infinite hidden Markov models.
method Systematically evaluated distance-based clustering, model-based, and uniform initializations.
result Distance-based clustering initializations consistently outperform other methods.

The moduli space of the Calabi-Yau three-folds, which play a role as superstring ground states, exhibits the same {\em special geometry} that is known from nonlinear sigma models in N=2N=2 supergravity theories. We discuss the symmetry structure of special real, complex and quaternionic spaces. Maps between these spaces…

1993-10-13abs ↗pdf ↗

Study on multi-agent decision making complexity, showing sample efficiency gaps.

problem Understanding sample efficiency in multi-agent decision making.
method General framework for interactive decision making, focusing on equilibrium computation.
result No 'reasonable' complexity measure can close gaps between single and multiple agents.

This paper examines transitions in sniping behavior among algorithmic traders, finding new profitable strategies.

problem Understanding transitions from sure to probabilistic sniping in competitive algorithmic trading environments.
method Reinterpretation and extension of Menkveld and Zoican's stylized game, analysis of repeated games, sequential statistical testing.
result Probabilistic sniping can be profitable in certain conditions, resembling the prisoner's dilemma.

A game environment simulates competition among many agents for resources.

problem Understanding large-scale multiagent interactions and resource competition.
method Developed a persistent, massively multiplayer AI environment.
result Population size affects the development of skillful behaviors and niche differentiation.

FEALM learns features for better nonlinear DR of hidden patterns.

problem DR misses important patterns on distorted manifolds.
method FEALM generates optimized projections using an optimization algorithm and neighbor-shape dissimilarity.
result FEALM captures important patterns on hidden manifolds.

We propose dynamical systems trees (DSTs) as a flexible class of models for describing multiple processes that interact via a hierarchy of aggregating parent chains. DSTs extend Kalman filters, hidden Markov models and nonlinear dynamical systems to an interactive group scenario. Various individual processes interact a…

2012-07-11abs ↗pdf ↗

Regularized training of an autoencoder typically results in hidden unit biases that take on large negative values. We show that negative biases are a natural result of using a hidden layer whose responsibility is to both represent the input data and act as a selection mechanism that ensures sparsity of the representati…

2014-02-13abs ↗pdf ↗

Study on generalisation in random feature learning and hidden manifold models.

problem Generalisation in high-dimensional learning problems.
method Replica method from statistical physics for asymptotic generalisation performance.
result Closed-form expression for generalisation performance in various high-dimensional settings.

Research explores how interconnected systems synchronize and how to control their behavior.

problem Understanding and controlling the behavior of interconnected dynamical systems.
method Mean field games approach applied to controlled coupled oscillators.
result Developed methods to predict and influence emergent phenomena in interconnected systems.