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

70140210280 · Jun 202019922001200920172026
48 results for agent outcome maximization

New algorithms optimize decision rules in strategic scenarios, minimizing prediction risk and incentivizing better outcomes.

problem Strategic agents manipulate features to improve outcomes, complicating decision-making models.
method Efficient algorithms for learning decision rules that minimize prediction risk, incentivize better outcomes, and estimate true model coefficients.
result Optimal decision rules can be learned through testing and observing agent responses, circumventing hardness results.

In principal-agent models, a principal offers a contract to an agent to perform a certain task. The agent exerts a level of effort that maximizes her utility. The principal is oblivious to the agent's chosen level of effort, and conditions her wage only on possible outcomes. In this work, we consider a model in which t…

2018-11-16abs ↗pdf ↗

Equilibrium found for multi-agent trading with transaction costs.

problem Designing a trading equilibrium for multiple agents with transaction costs.
method Proving the existence of a continuous-time Radner equilibrium with incentives and transaction costs.
result Each agent optimally trades for a specific time interval before stopping, influenced by transaction costs.

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 ↗

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.

Explains agent behavior through intended outcomes in reinforcement learning.

problem Proving impossibility of general post-hoc explanations in reinforcement learning.
method Derives local explanations based on intention for Q-function approximations, proving consistency with learned Q-values.
result Demonstrates the necessity of collecting information during training for accurate explanations.

The game theory techniques are used to find the equilibrium of a market. Game theory refers to the ways in which strategic interactions among economic agents produce outcomes with respect to the preferences (or utilities) of those agents, where the outcomes in question might have been intended by none of the agents. Th…

2012-10-23abs ↗pdf ↗

Algorithms are often used to produce decision-making rules that classify or evaluate individuals. When these individuals have incentives to be classified a certain way, they may behave strategically to influence their outcomes. We develop a model for how strategic agents can invest effort in order to change the outcome…

2018-07-13abs ↗pdf ↗

Agents learn to outperform in trading by using past and current prices.

problem Optimal trading performance beyond theoretical limits.
method Two-agent Almgren-Chriss liquidation game, schedule-learning, DDQN architectures.
result Agents with access to past and current prices achieve supra-competitive outcomes.

InfoTree improves reinforcement learning by optimizing tool use with a greedy submodular approach.

problem Maximizing information from tool use in reinforcement learning with limited resources.
method Formalizes Rollout Informativeness, recasts state selection as submodular maximization, and uses UUCB and ABA.
result InfoTree outperforms existing methods across various benchmarks, improving performance by 18.2% on average.

Study on learning strategies in matching markets with uncertain preferences.

problem Decision-making in scarcity of shared resources with unknown agent preferences.
method Representation of preferences in a reproducing kernel Hilbert space, learning algorithm for uncertainty.
result Optimal strategies derived to maximize agents' expected payoffs, with stability and fairness properties.

A method to train multi-agent reinforcement learning models without intrinsic rewards.

problem Training multi-agent reinforcement learning models with sparse rewards is challenging.
method A learning-based exploration strategy using variational graph autoencoder to generate initial states.
result The method improves the training and performance of multi-agent reinforcement learning models.

MA-COPP predicts multi-agent system outcomes using data from a different policy, with probabilistic guarantees.

problem Predicting outcomes in multi-agent systems using data from a different policy.
method Conformal prediction framework applied to multi-agent systems, avoiding exhaustive search.
result Achieves probabilistic guarantees for multi-agent system predictions.

Reinforcement learning refers to a group of methods from artificial intelligence where an agent performs learning through trial and error. It differs from supervised learning, since reinforcement learning requires no explicit labels; instead, the agent interacts continuously with its environment. That is, the agent sta…

2018-09-29abs ↗pdf ↗

There is tremendous interest in precision medicine as a means to improve patient outcomes by tailoring treatment to individual characteristics. An individualized treatment rule formalizes precision medicine as a map from patient information to a recommended treatment. A treatment rule is defined to be optimal if it max…

2017-11-28abs ↗pdf ↗

The valuation process that economic agents undergo for investments with uncertain payoff typically depends on their statistical views on possible future outcomes, their attitudes toward risk, and, of course, the payoff structure itself. Yields vary across different investment opportunities and their interrelations are …

2010-01-08abs ↗pdf ↗

Optimizes long-term social welfare in recommender systems by matching users to providers.

problem Realistic recommender systems dynamics affect all agents, not just users.
method Formulated as an optimal constrained matching problem, solved using dynamical system equilibrium selection.
result Ensures maximal social welfare with diverse viable providers, improving over myopic matching.

DEBIAS learns causal effects from psychiatric longitudinal data by optimizing outcome weights.

problem Causal inference challenges in psychiatric longitudinal data due to symptom heterogeneity and latent confounding.
method DEBIAS algorithm that optimizes outcome weights to maximize durable treatment effects and minimize confounding.
result DEBIAS consistently outperforms state-of-the-art methods in recovering causal effects for clinically interpretable composite outcomes.

Unified framework for human-like decision making in various sequential tasks.

problem Real-life decision-making involves diverse strategies leading to similar outcomes.
method Two-stream reward processing mechanism for flexible and unified models.
result Framework unified MAB, CB, and RL with comparable performance.

Active inference minimizes expected free energy for optimal behavior.

problem Understanding and optimizing behavior in complex systems.
method Combines Bayesian decision theory, optimal Bayesian design, and the free energy principle.
result Active inference emerges as a unified framework for information-seeking, utility maximization, and goal-directed behavior.

We propose a probabilistic modeling framework for learning the dynamic patterns in the collective behaviors of social agents and developing profiles for different behavioral groups, using data collected from multiple information sources. The proposed model is based on a hierarchical Bayesian process, in which each obse…

2016-06-24abs ↗pdf ↗

The paper shows how shared random seeds can reduce variance in machine learning evaluations.

problem The statistical structure of comparative evaluation under shared random seeds is not well understood.
method An extended learning-based multi-agent economic simulator was used to demonstrate the effects of shared random seeds on variance reduction.
result Pairing seeds can reduce variance in machine learning evaluations, especially when outcomes are positively correlated at the seed level.

Optimizes treatment duration to maximize quality-adjusted lifetime.

problem Balancing risks and benefits in clinical decision making.
method Proposes a weighted estimating equation to adjust for confounding and informative censoring, and a nonparametric estimator for mean counterfactual quality-adjusted lifetime.
result Shows the optimal time for percutaneous endoscopic gastrostomy insertion in ALS patients.

Efficient sequential matching of supply and demand is a problem of interest in many online to offline services. For instance, Uber, Lyft, Grab for matching taxis to customers; Ubereats, Deliveroo, FoodPanda etc for matching restaurants to customers. In these online to offline service problems, individuals who are respo…

2018-03-27abs ↗pdf ↗

We discuss here the mean-field theory for a cellular automata model of meta-learning. The meta-learning is the process of combining outcomes of individual learning procedures in order to determine the final decision with higher accuracy than any single learning method. Our method is constructed from an ensemble of inte…

2009-07-27abs ↗pdf ↗

New algorithm tackles unknown utility network resource allocation.

problem Maximizing network utility with unknown agent utilities.
method Modeling as a bandit problem, proposing algorithms for resource allocation.
result Proposed algorithms are optimal when all agents have the same utility.

Algorithm maximizes total reward in multi-agent bandits with adversarial corruptions.

problem Maximizing total reward in multi-agent bandits with adversarial corruptions.
method Proposes a cooperative learning algorithm robust to adversarial corruptions.
result Demonstrates an additive O((L/Lmin)C)O((L / L_{\min}) C) regret term for an adversary with unknown corruption budget.

The paper targets optimal interventions for long-term outcomes using imputed data and policy learning.

problem Maximizing long-term outcomes observed only in the future.
method Imputing missing long-term outcomes and using a doubly-robust approach for policy evaluation and optimization.
result The approach outperforms simple short-term proxies and achieves significant revenue impact over three years.

We provide an axiomatic foundation for the representation of numéraire-invariant preferences of economic agents acting in a financial market. In a static environment, the simple axioms turn out to be equivalent to the following choice rule: the agent prefers one outcome over another if and only if the expected (under t…

2009-03-22abs ↗pdf ↗