The Affective Behavior Analysis in-the-wild (ABAW) 2020 Competition is the first Competition aiming at automatic analysis of the three main behavior tasks of valence-arousal estimation, basic expression recognition and action unit detection. It is split into three Challenges, each one addressing a respective behavior t…
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
48 results for “competitive utility”
We study a portfolio optimization problem for competitive agents with CRRA utilities and a common finite time horizon. The utility of an agent depends not only on her absolute wealth and consumption but also on her relative wealth and consumption when compared to the averages among the other agents. We derive a closed …
Study optimal investment strategies for competitive agents using Mean Field Games.
problem Optimizing portfolios with relative performance criteria.
method Mean Field Game framework applied to CRRA and CARA utility cases.
result Derivation of optimal investment and consumption strategies.
Forward utility and market adjustments in relative investment-consumption games of many playersecon.GN
Study many-player investment-consumption games with power FPPs, finding market-risk preference affects consumption.
problem Investment and consumption optimization in a mean field competition setting.
method Solve many-player and mean field games using power FPPs, providing closed-form solutions.
result Market-risk relative consumption preference affects agent's consumption decisions.
Study optimal investment in large populations of competitive, heterogeneous agents.
problem Maximizing utility in a large, interacting agent system with relative performance concerns.
method Analyzes stochastic utility maximization game in finite and infinite agent settings, using graphon models and backward stochastic differential equations.
result Convergence of Nash equilibria and optimal utilities from finite to infinite agent models under specific conditions.
Proposes CoPO, a new policy optimization method for competitive games.
problem Designing efficient optimization methods for competitive Markov decision processes.
method Competitive policy optimization (CoPO) approach that exploits game-theoretic nature of competitive games.
result Stable optimization, convergence to sophisticated strategies, and higher scores compared to baseline methods.
Study optimal investment and consumption strategies for competitive agents with habit formation.
problem Optimal investment and consumption strategies for competitive agents with habit formation.
method Formulated n-agent game problems and mean field game problems, derived mean field equilibrium, constructed approximate Nash equilibrium.
result Explicit convergence order of approximate Nash equilibrium can be obtained.
Study time-inconsistent portfolio optimization for competitive agents with relative performance criteria.
problem Time-inconsistent mean field and n-agent games under relative performance criteria.
method Construct open-loop equilibrium strategies for n-agent games and mean field games.
result Explicit solutions for n-agent games and mean field games, unique in a special class of equilibria.
Informed traders strategically reveal noisier signals, making prices less responsive to public information.
problem How informed traders strategically reveal signals impacts market prices and utility.
method Modeling a market with an informed trader, an uninformed trader, and liquidity providers, proving equilibrium existence.
result In equilibrium, the insider strategically reveals a noisier signal, making prices less responsive to public information.
An artificial general intelligence (AGI) might have an instrumental drive to modify its utility function to improve its ability to cooperate, bargain, promise, threaten, and resist and engage in blackmail. Such an AGI would necessarily have a utility function that was at least partially observable and that was influenc…
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.
Differentially private algorithms for submodular maximization under various constraints.
problem Maximizing decomposable submodular functions under constraints while preserving privacy.
method Designing differentially private algorithms for both monotone and non-monotone decomposable submodular maximization under general matroid constraints.
result Improved utility guarantees and competitive performance compared to non-private algorithms.
Socio-economic utility and chemical potentialphysics.soc-ph
In statistical physics, the conservation of particle number results in the equalization of the chemical potential throughout a system at equilibrium. In contrast, the homogeneity of utility in socio-economic models is usually thought to rely on the competition between individuals, leading to Nash equilibrium. We show t…
The study examines Nash equilibria in utility maximization games with multiplicative performance criteria.
problem Existence and uniqueness of Nash equilibria in multiplicative performance criteria games.
method General characterization of Nash equilibria for a large class of utility functions.
result Existence and uniqueness of Nash equilibria for arbitrary initial wealth vectors.
Examines optimal risk sharing with realistic risk attitudes, finding risk seeking in certain subdomains.
problem Optimal risk sharing with empirically realistic risk attitudes.
method Allows for risk-seeking agents, generalizes expected utility, and uses counter-monotonic improvement theorem.
result First empirical results on optimal risk sharing with realistic risk attitudes.
Investigates portfolio selection among competitive agents with mean-variance preferences.
problem Optimizing portfolios with multi-agent competition and relative wealth comparison.
method Reformulated as a constrained, non-homogeneous stochastic linear-quadratic control problem; derived optimal feedback strategies; used decoupling techniques and fixed-point theory to solve nonlinear BSDEs.
result Characterized three scenarios based on market and competition parameters: unique Nash equilibrium, no Nash equilibrium, or infinitely many Nash equilibria.
We propose a mean field game model to study the question of how centralization of reward and computational power occur in Bitcoin-like cryptocurrencies. Miners compete against each other for mining rewards by increasing their computational power. This leads to a novel mean field game of jump intensity control, which we…
The paper analyzes competition among fund managers using excess logarithmic returns and constructs games to find optimal allocations.
problem Optimal allocation strategies among fund managers considering excess logarithmic returns.
method Constructs both -player and mean field games to address the competition problem.
result The MFE of the MFG represents the limit of -player game's equilibrium as approaches infinity.
-player and Mean-field Games in Itô-diffusion Markets with Competitive or Homophilous Interactionq-fin.MF
Study -player and mean-field games in Itô-diffusion markets with competitive or homophilous interactions.
problem Optimal portfolio choice in a common market with interacting players.
method Analyzes -player and mean-field games in incomplete and complete markets with CARA utilities and random risk tolerances.
result Derives explicit or closed-form solutions for equilibrium processes and game values.
We analyze a family of portfolio management problems under relative performance criteria, for fund managers having CARA or CRRA utilities and trading in a common investment horizon in log-normal markets. We construct explicit constant equilibrium strategies for both the finite population games and the corresponding mea…
A new method for analyzing product competition using low-dimensional embeddings.
problem Computational challenges in studying product-level competition for millions of products.
method Product2Vec, a method based on representation learning algorithm Word2Vec.
result The method produces more accurate demand forecasts and price elasticities compared to state-of-the-art models.
Neural networks approximate random utility models for choice prediction.
problem Approximating random utility models with neural networks.
method RUMnets, a neural network-based model inspired by RUM framework.
result RUMnets can approximate any RUM model arbitrarily closely and vice versa.
Improves matrix completion by exploiting biased observation patterns.
problem Matrix completion with biased observation patterns.
method Mask Nearest Neighbor (MNN) algorithm: two-stage process.
result MNN achieves competitive performance with 28x smaller mean squared error.
Parametric quantile regressions are a useful tool for creating probabilistic energy forecasts. Nonetheless, since classical quantile regressions are trained using a non-differentiable cost function, their creation using complex data mining techniques (e.g., artificial neural networks) may be complicated. This article p…
Market equilibrium price proven in a large-agent model.
problem Proving market equilibrium in a large-agent setting.
method Proved existence of equilibrium price in a complete, continuous time market with infinite agents.
result The equilibrium price dynamics decouple as the number of agents increases.
While a user's preference is directly reflected in the interactive choice process between her and the recommender, this wealth of information was not fully exploited for learning recommender models. In particular, existing collaborative filtering (CF) approaches take into account only the binary events of user actions …
Study of insurer games with model uncertainty in reinsurance and investment strategies.
problem Model uncertainty and competitive insurers' performance under worst-case scenarios.
method Formulated robust mean-field game for non-linear system, derived closed-form solutions.
result Relative concerns lead to new hedging terms in investment and reinsurance strategies.
Modelling all possible life cycles of a company in a highly competitive economic environment gives a significant advantage to the owner in his business investment activities. This article proposes and analyses a dynamic model of a company's life cycle with known action costs and transition probabilities, that can be af…
Generative Adversarial Networks (GANs) have experienced a recent surge in popularity, performing competitively in a variety of tasks, especially in computer vision. However, GAN training has shown limited success in natural language processing. This is largely because sequences of text are discrete, and thus gradients …
Linear models like EASE and SLIM are competitive in recommendation, and this work explores their theoretical relationship.
problem Understanding the relationship between linear models and matrix factorization in recommendation systems.
method Derivation and analysis of closed-form solutions for regression and matrix factorization approaches.
result Linear models and matrix factorization approaches are related but diverge in scaling singular values.
High-risk domains require reliable confidence estimates from predictive models. Deep latent variable models provide these, but suffer from the rigid variational distributions used for tractable inference, which err on the side of overconfidence. We propose Stochastic Quantized Activation Distributions (SQUAD), which im…
Energy game-theoretic frameworks have emerged to be a successful strategy to encourage energy efficient behavior in large scale by leveraging human-in-the-loop strategy. A number of such frameworks have been introduced over the years which formulate the energy saving process as a competitive game with appropriate incen…
SNPLA uses normalizing flows for efficient inference in implicit models.
problem Efficient inference in implicit models with complex likelihood and posterior learning.
method Sequential Neural Posterior and Likelihood Approximation (SNPLA) algorithm using normalizing flows.
result SNPLA achieves competitive performance with faster posterior draws compared to MCMC methods.
In this study, we propose the integration of competitive learning into convolutional neural networks (CNNs) to improve the representation learning and efficiency of fine-tuning. Conventional CNNs use back propagation learning, and it enables powerful representation learning by a discrimination task. However, it require…
In a continuous-time setting where a risk-averse agent controls the drift of an output process driven by a Brownian motion, optimal contracts are linear in the terminal output; this result is well-known in a setting with moral hazard and -under stronger assumptions - adverse selection. We show that this result continue…
Model shows incentives in shared order book can lead to free-rider problem.
problem Incentives in shared order books can lead to free-rider problem.
method Developed a Principal-Agent model with CARA utility functions.
result Equilibrium analysis shows incentives can lead to reduced competition.
The paper revisits classical competition theory to explain speculative asset price dynamics.
problem Understanding the dynamics of speculative asset prices and their volatility.
method Specialized classical model of competition with reservation prices, incorporating speculation.
result The model explains excess, fat-tailed, and clustered volatility in speculative asset prices.
The paper solves portfolio optimization problems with risk constraints.
problem Maximizing utility while ensuring a certain wealth threshold with risk constraints.
method Derives Nash equilibria for two agents and characterizes them for more than two agents.
result Characterizes Nash equilibria for different cases of competition probabilities.
State-of-the-art image recognition systems use sophisticated Convolutional Neural Networks (CNNs) that are designed and trained to identify numerous object classes. Such networks are fairly resource intensive to compute, prohibiting their deployment on resource-constrained embedded platforms. On one hand, the ability t…
Large multi-tenant production clusters often have to handle a variety of jobs and applications with a variety of complex resource usage characteristics. It is non-trivial and non-optimal to manually create placement rules for scheduling that would decide which applications should co-locate. In this paper, we present De…
Parallel sentence extraction is a task addressing the data sparsity problem found in multilingual natural language processing applications. We propose a bidirectional recurrent neural network based approach to extract parallel sentences from collections of multilingual texts. Our experiments with noisy parallel corpora…
This paper investigates a hybrid stochastic differential reinsurance and investment game between one reinsurer and two insurers, including a stochastic Stackelberg differential subgame and a non-zero-sum stochastic differential subgame. The reinsurer, as the leader of the Stackelberg game, can price reinsurance premium…
We examine the supervised learning problem in its continuous setting and give a general optimality condition through techniques of functional analysis and the calculus of variations. This enables us to solve the optimality condition for the desired function u numerically and make several comparisons with other widely u…
Most neural networks utilize the same amount of compute for every example independent of the inherent complexity of the input. Further, methods that adapt the amount of computation to the example focus on finding a fixed inference-time computational graph per example, ignoring any external computational budgets or vary…
Word embeddings have been shown to be useful across state-of-the-art systems in many natural language processing tasks, ranging from question answering systems to dependency parsing. (Herbelot and Vecchi, 2015) explored word embeddings and their utility for modeling language semantics. In particular, they presented an …
Paper establishes statistical inference for pairwise comparison models.
problem Statistical inference for pairwise comparison models when the number of subjects diverges.
method Identifies Fisher information matrix as a weighted graph Laplacian for asymptotic normality.
result Near-optimal asymptotic normality result for maximum likelihood estimator.
Paper presents a novel approach for global feature aggregation in Graph Neural Networks.
problem Graphs lack a straightforward way to perform non-local feature aggregation like images and texts.
method Utilizes Latent Fixed Data Structure (LFDS) to aggregate feature vectors from local extraction.
result Proposed methods achieve competitive or better results with linear computational complexity.
New approach for algorithms that learn predictors to improve performance.
problem Improving algorithm performance by learning better predictions.
method Identify functional dependence and apply online learning techniques.
result Improved results in various online settings with simpler analysis.