Related papers: Exploration noise for learning linear-quadratic me…
Consistency training regularizes a model by enforcing predictions of original and perturbed inputs to be similar. Previous studies have proposed various augmentation methods for the perturbation but are limited in that they are agnostic to…
Non-cooperative and cooperative games with a very large number of players have many applications but remain generally intractable when the number of players increases. Introduced by Lasry and Lions, and Huang, Caines and Malham\'e, Mean…
We construct a semi-Lagrangian scheme for first-order, time-dependent, and non-local Mean Field Games. The convergence of the scheme to a weak solution of the system is analyzed by exploiting a key monotonicity property. To solve the…
This paper considers mean field games with optimal stopping time (OSMFGs) where agents make optimal exit decisions, the coupled obstacle and Fokker-Planck equations in such models pose challenges versus classic MFGs. This paper proposes a…
In this paper we explore the impact of quantiles on optimal strategies under state dynamics driven by both individual noise, common noise and Poisson jumps. We first establish an optimality system satisfied the quantile process under jump…
Here, we consider a regularized mean-field game model that features a low-order regularization. We prove the existence of solutions with positive density. To do so, we combine a priori estimates with the continuation method. In contrast…
Reinforcement learning is a powerful tool to learn the optimal policy of possibly multiple agents by interacting with the environment. As the number of agents grow to be very large, the system can be approximated by a mean-field problem.…
This paper proposes using a linear function approximator, rather than a deep neural network (DNN), to bias a Monte Carlo tree search (MCTS) player for general games. This is unlikely to match the potential raw playing strength of DNNs, but…
Variational inference with a factorized Gaussian posterior estimate is a widely used approach for learning parameters and hidden variables. Empirically, a regularizing effect can be observed that is poorly understood. In this work, we show…
This paper presents results from the design and testing of an educational version of Quantum Moves, a Scientific Discovery Game that allows players to help solve authentic scientific challenges in the effort to develop a quantum computer.…
In classical mechanics, a natural way to simplify a many-body problem is to ``replace'' some of the elements of the composite system with surrogate \textit{force fields}. In the realm of quantum mechanics, however, such a description is…
Synergy between evolutionary dynamics of cooperation and fluctuating state of shared resource being consumed by the cooperators is essential for averting the tragedy of the commons. Not only in humans, but also in the cognitively-limited…
In an inverse game problem, one needs to infer the cost function of the players in a game such that a desired joint strategy is a Nash equilibrium. We study the inverse game problem for a class of multiplayer matrix games, where the cost…
This paper is concerned with a class of linear-quadratic stochastic large-population problems with partial information, where the individual agent only has access to a noisy observation process related to the state. The dynamics of each…
We present a study of a phase-separation process induced by the presence of spatially-correlated multiplicative noise. We develop a mean-field approach suitable for conserved-order-parameter systems and use it to obtain the phase diagram of…
We present a general computation model inspired in the notion of information hiding in software engineering. This model has the form of a game which we call quiz game. It allows in a uniform way to prove exponential lower bounds for several…
Mean-field theory has been extensively explored in decision analysis of {large-scale} (LS) systems but traditionally in ``pure" cooperative or competitive settings. This leads to the so-called mean-field game (MG) or mean-field team (MT).…
Fictitious play (FP) is a well-studied algorithm that enables agents to learn Nash equilibrium in games with certain reward structures. However, when agents have no prior knowledge of the reward functions, FP faces a major challenge: the…
Despite rapid advances in speech recognition, current models remain brittle to superficial perturbations to their inputs. Small amounts of noise can destroy the performance of an otherwise state-of-the-art model. To harden models against…
Procedural noise is a fundamental component of computer graphics pipelines, offering a flexible way to generate textures that exhibit "natural" random variation. Many different types of noise exist, each produced by a separate algorithm. In…