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

Trend · papers per month

4998147196 · Jun 202019922001200920182026
48 results for public goods game

The study examines how individual ability and project benefit influence cooperation in public goods games.

problem Maximizing cooperation in public goods games with varying individual contributions and benefits.
method A generalized public goods game model incorporating individual ability and project benefit.
result The upper limit of individual benefit promotes cooperation, while the upper limit of individual contribution inhibits it.

Income redistribution boosts cooperation in spatial public goods games, but the effect depends on the model of redistribution.

problem The impact of income redistribution on cooperation in spatial public goods games.
method Two models of income redistribution were used: local and global. Spatial public goods games were employed to study the evolution of cooperation.
result The cooperation level is significantly higher with local redistribution of income, but lower with global redistribution.

Potential games, originally introduced in the early 1990's by Lloyd Shapley, the 2012 Nobel Laureate in Economics, and his colleague Dov Monderer, are a very important class of models in game theory. They have special properties such as the existence of Nash equilibria in pure strategies. This note introduces graphical…

2015-05-06abs ↗pdf ↗

This paper relaxes the common prior assumption in the public and private information game of Morris and Shin (2000, 2004). For the generalized game, where the agent's prior expectations are heterogenous, it derives a sharp condition for the emergence of unique/multiple equilibria. This condition indicates that unique e…

2013-12-30abs ↗pdf ↗

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 nn-player and mean field games to address the competition problem.
result The MFE of the MFG represents the limit of nn-player game's equilibrium as nn approaches infinity.

We study continuous time Bertrand oligopolies in which a small number of firms producing similar goods compete with one another by setting prices. We first analyze a static version of this game in order to better understand the strategies played in the dynamic setting. Within the static game, we characterize the Nash e…

2010-04-10abs ↗pdf ↗

A game theory study examines gradual concessions in variable contribution games under uncertainty.

problem Gradualism in contribution games due to free rider effect.
method Stochastic game analysis of variable contribution games, extending Nerlove-Arrow model.
result Equilibrium characterized by regular control strategies leading to gradual concession.

DREAM learns optimal strategies in imperfect games without needing a simulator.

problem Learning optimal strategies in imperfect-information games with multiple agents.
method DREAM is a deep reinforcement learning algorithm that converges to Nash Equilibria and coarse correlated equilibria.
result DREAM achieves state-of-the-art performance in benchmark games and is competitive with simulator-based algorithms.

AttriGuard defends against attribute inference attacks via adversarial machine learning.

problem Attribute inference attacks on user data from public data.
method Two phases: finding minimum noise and sampling attribute values.
result AttriGuard outperforms existing methods in protecting user data.

New algorithm finds optimal sample complexity for pure exploration with multiple good answers.

problem Determining the optimal number of samples needed to explore multiple good answers in a bandit problem.
method Derive lower bound using game equilibrium, extend Track-and-Stop algorithm to multiple answers.
result New algorithm has asymptotic sample complexity matching the derived lower bound.

JPS improves joint policies for multi-agent collaboration in imperfect information games.

problem Learning good joint policies for multi-agent collaboration with imperfect information.
method Decomposes global changes to localized policy changes, iteratively improving joint policies without re-evaluating the entire game.
result JPS improves solutions provided by unilateral approaches and outperforms algorithms designed for collaborative policy learning.

Bayesian model predicts public transport usage during events.

problem Difficulty in predicting transportation disruptions during special events.
method Bayesian additive model with Gaussian process components, using smart card records and web data.
result Model outperforms baselines by up to 26% in R2 and explains individual event components.

Combines human demonstrations and preferences to learn rewards for reinforcement learning.

problem Learning reward functions for complex real-world reinforcement learning problems.
method Trains a deep neural network to model reward functions from human demonstrations and preferences, then uses the model to train a DQN agent.
result Achieves superhuman performance on 2 Atari games without using game rewards.

A variation of the Minority Game has been applied to study the timing of promotional actions at retailers in the fast moving consumer goods market. The underlying hypotheses for this work are that price promotions are more effective when fewer than average competitors do a promotion, and that a promotion strategy can b…

2004-10-27abs ↗pdf ↗

Game theory models futures market dynamics with incomplete information.

problem Modeling competition and price dynamics in futures markets with incomplete information.
method Formalizes a multi-step, non-cooperative game for n players.
result Reduction in price gaps due to high competition improves market liquidity.

New algorithms achieve logarithmic regret in KL-regularized Markov games.

problem Improving sample efficiency in game-theoretic settings with KL regularization.
method Developed OMG and SOMG algorithms for matrix and Markov games, using best response sampling and superoptimistic bonuses.
result Logarithmic regret in TT that scales inversely with KL regularization strength ββ.

Paper tackles inverse reinforcement learning with non-optimal demonstrations in zero-sum games.

problem Inverse reinforcement learning with sub-optimal expert demonstrations in zero-sum games.
method Introduces a new objective function and algorithm to find reward function and strategies without decoupling agents.
result Demonstrates recovery of reward functions and strategies with good quality from sub-optimal expert demonstrations.

Research analyzes public opinions on Twitter about diabetes, diet, exercise, and obesity.

problem Understanding public health opinions on social media.
method Developed a multi-component semantic and linguistic framework to collect and analyze Twitter data.
result Strongest correlation found between exercise and obesity; other notable correlations between diabetes and obesity, diet and obesity.

Study shows curiosity-driven learning can perform well without extrinsic rewards.

problem Lack of scalable methods for intrinsic reward design in reinforcement learning.
method Performed a large-scale study of curiosity-driven learning across 54 environments, using prediction error as reward.
result Curiosity-driven learning can achieve good performance without extrinsic rewards, aligning with hand-designed rewards in many cases.

Paper explains adversarial training's robust overfitting through a minimax game perspective.

problem Adversarial training suffers from robust overfitting after learning rate decay.
method Viewing adversarial training as a dynamic minimax game, analyzing how LR decay breaks balance and leads to overfitting.
result ReBalanced Adversarial Training (ReBAT) alleviates robust overfitting without sacrificing robustness.